Problem: The Olympic Games in Bercouver are in full swing now. Here everyone has their own objectives: sportsmen compete for medals, and sport commentators compete for more convenient positions to give a running commentary. Today the main sport events take place at three round stadiums, and the commentator's objective is to choose the best point of observation, that is to say the point from where all the three stadiums can be observed. As all the sport competitions are of the same importance, the stadiums should be observed at the same angle. If the number of points meeting the conditions is more than one, the point with the maximum angle of observation is prefered. 

Would you, please, help the famous Berland commentator G. Berniev to find the best point of observation. It should be noted, that the stadiums do not hide each other, the commentator can easily see one stadium through the other.

Input

The input data consists of three lines, each of them describes the position of one stadium. The lines have the format x, y, r, where (x, y) are the coordinates of the stadium's center ( - 103 ≤ x, y ≤ 103), and r (1 ≤ r ≤ 103) is its radius. All the numbers in the input data are integer, stadiums do not have common points, and their centers are not on the same line. 

Output

Print the coordinates of the required point with five digits after the decimal point. If there is no answer meeting the conditions, the program shouldn't print anything. The output data should be left blank.

Examples

Input

0 0 10
60 0 10
30 30 10


Output

30.00000 0.00000

Solution (in JAVA):

Solution:
import java.util.Scanner;

public class CF2C {
	final static double err = 1e-7;
	
	static class Point {
		double X, Y;
		
		Point(double x, double y) {
			X = x;
			Y = y;
		}
		
		static double distance(Point p, Point q) {
			return Math.sqrt((p.X - q.X) * (p.X - q.X) + (p.Y - q.Y) * (p.Y - q.Y));  
		}
		
		static Point midpoint(Point p, Point q) {
			return new Point((p.X + q.X) / 2, (p.Y + q.Y) / 2);
		}
		
		static Line bisection(Point p, Point q) {
			return new Line(q.X - p.X, q.Y - p.Y, (p.X * p.X + p.Y * p.Y - q.X * q.X - q.Y * q.Y) / 2);
		}
		
		Point perpendicular(Line l) {
			return Line.intersection(l, new Line(l.B, -l.A, l.A * Y - l.B * X));
		}
		
		double distance(Line l) {
			return Math.abs(l.A * X + l.B * Y + l.C) / Math.sqrt(l.A * l.A + l.B * l.B);
		}
	}
	
	static class Line {
		double A, B, C;
		
		Line(double a, double b, double c) {
			A = a;
			B = b;
			C = c;
		}
		
		static Point intersection(Line m, Line n) {
			return new Point((m.C * n.B - m.B * n.C) / (m.B * n.A - m.A * n.B), (m.A * n.C - m.C * n.A) / (m.B * n.A - m.A * n.B));
		}
		
		Point[] intersection(Circle c) {
			if(CF2C.equals(c.O.distance(this), c.R))
				return new Point[]{c.O.perpendicular(this)};
			if(c.O.distance(this) > c.R)
				return null;
			else {
				Point ppd = c.O.perpendicular(this);
				double dis = Math.sqrt(c.R * c.R - c.O.distance(this) * c.O.distance(this));
				Point[] ans = new Point[2];
				for(int i = -1; i <= 1; i += 2)
					ans[(i + 1) / 2] = new Point(ppd.X + B * dis * i / Math.sqrt(A * A + B * B), ppd.Y - A * dis * i / Math.sqrt(A * A + B * B));
				return ans;
			}
		}
	}
	
	static class Circle {
		Point O;
		double R;
		
		Circle(double x, double y, double r) {
			O = new Point(x, y);
			R = r;
		}
		
		Circle(Point o, double r) {
			O = new Point(o.X, o.Y);
			R = r;
		}
		
		static Circle apollonius(Circle c1, Circle c2) {
			Point in = new Point((c1.R * c2.O.X + c2.R * c1.O.X) / (c1.R + c2.R), (c1.R * c2.O.Y + c2.R * c1.O.Y) / (c1.R + c2.R));
			Point out = new Point((c2.R * c1.O.X - c1.R * c2.O.X) / (c2.R - c1.R), (c2.R * c1.O.Y - c1.R * c2.O.Y) / (c2.R - c1.R));
			return new Circle(Point.midpoint(in, out), Point.distance(in, out) / 2);
		}
		
		static Line radicalAxis(Circle c1, Circle c2) {
			return new Line(c2.O.X - c1.O.X, c2.O.Y - c1.O.Y, (c1.O.X * c1.O.X + c1.O.Y * c1.O.Y - c2.O.X * c2.O.X - c2.O.Y * c2.O.Y + c2.R * c2.R - c1.R * c1.R) / 2);
		}
		
		static Point[] intersection(Circle c1, Circle c2) {
			return radicalAxis(c1, c2).intersection(c1);
		}
		
		void copy(Circle c) {
			O = new Point(c.O.X, c.O.Y);
			R = c.R;
		}
	}

	static boolean equals(double x, double y) {
		return Math.abs(x - y) < err;
	}
	
	private static void swap(Circle c1, Circle c2) {
		Circle tmp = new Circle(c1.O, c1.R);
		c1.copy(c2);
		c2.copy(tmp);
	}
	
	private static Point solve(Circle[] stadium) {
		if(equals(stadium[0].R, stadium[1].R) && equals(stadium[0].R, stadium[2].R)) {
			Line m = Point.bisection(stadium[0].O, stadium[1].O);
			Line n = Point.bisection(stadium[0].O, stadium[2].O);
			return Line.intersection(m, n);
		} else {
			if(equals(stadium[0].R, stadium[1].R))
				swap(stadium[0], stadium[2]);
			if(equals(stadium[0].R, stadium[2].R))
				swap(stadium[0], stadium[1]);
			Point[] ans = Circle.intersection(Circle.apollonius(stadium[0], stadium[1]), Circle.apollonius(stadium[0], stadium[2]));
			if(ans == null)
				return null;
			if(Point.distance(stadium[0].O, ans[0]) < Point.distance(stadium[0].O, ans[1]))
				return ans[0];
			else
				return ans[1];
		}
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		Circle[] stadium = new Circle[3];
		for(int i = 0; i < 3; i++)
			stadium[i] = new Circle(sc.nextDouble(), sc.nextDouble(), sc.nextDouble());
		sc.close();
		Point ans = solve(stadium);
		if(ans != null)
			System.out.printf("%.5f %.5f\n", equals(ans.X, 0.0) ? 0.0 : ans.X, equals(ans.Y, 0.0) ? 0.0 : ans.Y);
	}
}