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.io.*;
import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.fill;
import static java.util.Arrays.binarySearch;
import static java.util.Arrays.sort;

public class Main {
	public static void main(String[] args) throws IOException {
		new Thread(null, new Runnable() {
			public void run() {
				try {
					try {
						if (new File("input.txt").exists())
							System.setIn(new FileInputStream("input.txt"));
					} catch (SecurityException e) {}
					new Main().run();
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
		}, "1", 1L << 24).start(); 
	}

	BufferedReader in;
	PrintWriter out;
	StringTokenizer st = new StringTokenizer("");
	
	double EPS = 1e-7;
	
	Circle[] circles = new Circle [3];
	Shape[] shapes = new Shape [3];
	
	double best = -1e100;
	Point ans = null;
	
	void run() throws IOException {
		in = new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(System.out);
		
		circles[0] = new Circle(new Point(nextDouble(), nextDouble()), nextDouble());
		circles[1] = new Circle(new Point(nextDouble(), nextDouble()), nextDouble());
		circles[2] = new Circle(new Point(nextDouble(), nextDouble()), nextDouble());
		
		int k = 0;
		for (int i = 0; i < 3; i++)
			for (int j = i + 1; j < 3; j++)
				shapes[k++] = getShape(circles[i], circles[j]);
		for (int i = 0; i < 3; i++)
			for (int j = i + 1; j < 3; j++) {
				Point[] points = its(shapes[i], shapes[j]);
				if (points != null)
					lp: for (Point p : points) {
						for (Shape s : shapes)
							if (!s.containsPoint(p))
								continue lp;
						updateAnswer(p);
					}
			}
		
		if (ans != null) print(ans);
		
		out.close();
	}
	
	void print(Point ans) {
		if (abs(ans.x) < 1e-6) ans.x = 0.0;
		if (abs(ans.y) < 1e-6) ans.y = 0.0;
		out.printf(Locale.US, "%.6f %.6f%n", ans.x, ans.y);
	}

	void updateAnswer(Point p) {
		double angle = -10.0;
		for (Circle c : circles)
			angle = max(angle, getAngel(p, c));
		if (best < angle) {
			best = angle;
			ans = p;
		}
	}

	double getAngel(Point p, Circle c) {
		double d = dist(p, c.c);
		if (d < c.r + EPS) return Double.NaN;
		return asin(c.r / d);
	}

	Point[] its(Shape s1, Shape s2) {
		if (s1 instanceof Line && s2 instanceof Line)
			return cll((Line) s1, (Line) s2);
		if (s1 instanceof Circle && s2 instanceof Line)
			return ccl((Circle) s1, (Line) s2);
		if (s1 instanceof Line && s2 instanceof Circle)
			return ccl((Circle) s2, (Line) s1);
		if (s1 instanceof Circle && s2 instanceof Circle)
			return ccc((Circle) s1, (Circle) s2);
		return null;
	}

	Point[] cll(Line l1, Line l2) {
		double det = -det2x2(l1.A, l1.B, l2.A, l2.B);
		if (abs(det) < EPS) return null;
		return new Point[] { new Point(det2x2(l1.C, l1.B, l2.C, l2.B) / det, det2x2(l1.A, l1.C, l2.A, l2.C) / det) };
	}

	Point[] ccl(Circle c, Line l) {
		double d = l.dist(c.c);
		Point N = new Point(l.A, l.B);
		if (d > c.r + EPS) return null;
		if (d > c.r - EPS) return new Point[] { c.c.add(N.norm(c.r)) };
		Point u = c.c.add(N.norm(d));
		Point v = N.rot90().norm(sqrt(c.r * c.r - d * d));
		return new Point[] { u.sub(v), u.add(v) };
	}

	Point[] ccc(Circle c1, Circle c2) {
		if (c1.r > c2.r) return ccc(c2, c1);
		double d = dist(c1.c, c2.c);
		Point v = c2.c.sub(c1.c).norm(c1.r);
		if (d > c1.r + c2.r + EPS) return null;
		if (d > c1.r + c2.r - EPS) return new Point[] { c1.c.add(v) };
		if (c2.r > d + c1.r + EPS) return null;
		if (c2.r > d + c1.r - EPS) return new Point[] { c1.c.sub(v) };
		double cos = 0.5 * (c1.r * c1.r + d * d - c2.r * c2.r) / (d * c1.r);
		double sin = sqrt(1.0 - cos * cos);
		return new Point[] { c1.c.add(v.rotate(cos, -sin)), c1.c.add(v.rotate(cos, sin)) };
	}

	Shape getShape(Circle c1, Circle c2) {
		if (c1.r > c2.r) return getShape(c2, c1);
		Point v = c2.c.sub(c1.c);
		Point u = c1.c.add(v.mul(c1.r / (c1.r + c2.r)));
		if (abs(c1.r - c2.r) < EPS) {
			return new Line(u, u.add(v.rot90()));
		} else {
			Point w = c1.c.sub(v.mul(c1.r / (c2.r - c1.r)));
			return new Circle(u.add(w).mul(0.5), 0.5 * dist(u, w));
		}
	}
	
	double det2x2(double a1, double b1, double a2, double b2) {
		return a1 * b2 - a2 * b1;
	}
	
	double dist(Point p1, Point p2) {
		return sqrt(sqr(p2.x - p1.x) + sqr(p2.y - p1.y));
	}
	
	double sqr(double x) {
		return x * x;
	}

	class Point {
		double x;
		double y;

		Point(double x, double y) {
			this.x = x;
			this.y = y;
		}

		Point add(Point v) {
			return new Point(x + v.x, y + v.y);
		}
		
		Point sub(Point v) {
			return new Point(x - v.x, y - v.y);
		}
		
		Point mul(double K) {
			return new Point(K * x, K * y);
		}
		
		Point norm(double len) {
			return this.mul(len / this.len());
		}
		
		double len() {
			return sqrt(x * x + y * y);
		}

		Point rot90() {
			return new Point(-y, x);
		}
		
		Point rotate(double cos, double sin) {
			return new Point(x * cos - y * sin, x * sin + y * cos);
		}
		
		@Override
		public String toString() {
			return String.format(Locale.US, "(%.12f, %.12f)", x, y);
		}
	}
	
	interface Shape {
		boolean containsPoint(Point p);;
	}
	
	class Line implements Shape {
		Point p1;
		Point p2;
		double A, B, C;
		
		Line(Point p1, Point p2) {
			this.p1 = p1;
			this.p2 = p2;
			A = p2.y - p1.y;
			B = p1.x - p2.x;
			C = -(A * p1.x + B * p1.y);
		}

		double dist(Point p) {
			return abs(A * p.x + B * p.y + C) / sqrt(A * A + B * B);
		}
		
		@Override
		public boolean containsPoint(Point p) {
			return abs(A * p.x + B * p.y + C) < EPS;
		}

		@Override
		public String toString() {
			return "Line [p1=" + p1 + ", p2=" + p2 + "]";
		}
	}
	
	class Circle implements Shape {
		Point c;
		double r;

		Circle(Point c, double r) {
			this.c = c;
			this.r = r;
		}

		@Override
		public boolean containsPoint(Point p) {
			return abs(dist(c, p) - r) < EPS;
		}

		@Override
		public String toString() {
			return "Circle [c=" + c + ", r=" + String.format(Locale.US, "%.2f") + "]";
		}
	}
	
	/*************************************************************** 
	 * Utility
	 **************************************************************/
	long b2mb(long b) {
		return b >> 20;
	}
	
	void checkMemory() {
		System.err.println(b2mb(Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory()) + "/" + b2mb(Runtime.getRuntime().totalMemory()) + " MB");
	}
	
	/*************************************************************** 
	 * Input 
	 **************************************************************/
	String nextToken() throws IOException {
		while (!st.hasMoreTokens())
			st = new StringTokenizer(in.readLine());
		return st.nextToken();
	}
	
	int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}
	
	long nextLong() throws IOException {
		return Long.parseLong(nextToken());
	}
	
	double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}
	
	String nextLine() throws IOException {
		st = new StringTokenizer("");
		return in.readLine();
	}
	
	boolean EOF() throws IOException {
		while (!st.hasMoreTokens()) {
			String s = in.readLine();
			if (s == null)
				return true;
			st = new StringTokenizer(s);
		}
		return false;
	}
}