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

//OK (upsolving)
public class Main {

	private static final double EPS = 1e-6;

	public static void main(String[] args) throws IOException {
		try {
			if (new File("input.txt").exists())
				System.setIn(new FileInputStream("input.txt"));
		} catch (SecurityException e) {
		}
		new Main().run();
	}

	BufferedReader in;
	PrintWriter out;
	StringTokenizer st = new StringTokenizer("");

	class Circle {
		double r;
		Point cen;

		Circle(double x, double y, double r) {
			cen = new Point(x, y);
			this.r = r;
		}
	}

	class Line {
		double a, b, c;

		Line(double a, double b, double c) {
			this.a = a;
			this.b = b;
			this.c = c;
		}
		Line(double x1, double y1, double x2, double y2) {
			a = y1 - y2;
			b = x2 - x1;
			c = -(a * x1 + b * y1);
		}
		Line getNormal(double x, double y) {
			return new Line(-b, a, -(-b * x + a * y));
		}
		double dist(Point p) {
			return abs(a * p.x + b * p.y + c) / sqrt(a * a + b * b);
		}
	}

	class Point {
		double x, y;

		Point(double x, double y) {
			this.x = x;
			this.y = y;
		}
		Point mul(double f) {
			return new Point(x * f, y * f);
		}
		Point add(Point p) {
			return new Point(x + p.x, y + p.y);
		}
		Point sub(Point p) {
			return new Point(x - p.x, y - p.y);
		}
		double len() {
			return sqrt(x * x + y * y);
		}
		double dist(Point p) {
			return hypot(x - p.x, y - p.y);
		}
		Point rot(double cos, double sin) {
			return new Point(x * cos - y * sin, x * sin + y * cos);
		}
	}

	Circle c1, c2, c3;

	private void run() throws IOException {
		in = new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(System.out);
		c1 = new Circle(nextInt(), nextInt(), nextInt());
		c2 = new Circle(nextInt(), nextInt(), nextInt());
		c3 = new Circle(nextInt(), nextInt(), nextInt());
		Point res;
		if (c1.r == c2.r) {
			if (c1.r != c3.r)
				res = getBest(intersect(getLine(c1, c2), getCircle(c1, c3)));
			else
				res = intersect(getLine(c1, c2), getLine(c1, c3));
		} else {
			if (c1.r != c3.r)
				res = getBest(intersect(getCircle(c1, c2), getCircle(c1, c3)));
			else
				res = getBest(intersect(getLine(c1, c3), getCircle(c1, c2)));
		}
       if (res != null)
            out.printf("%.5f %.5f", res.x, res.y);
//		if (res != null)
//			out.printf(Locale.US, "%.5f %.5f", res.x, res.y);
		in.close();
		out.close();
	}
	private Point getBest(Point[] p) {
		if (p == null)
			return null;
		double minD = 1e100;
		Point res = null;
		for (int i = 0; i < p.length; i++)
			if (c1.cen.dist(p[i]) < minD) {
				minD = c1.cen.dist(p[i]);
				res = p[i];
			}
		return res;
	}

	private Point[] intersect(Circle c1, Circle c2) {
		double dist = c1.cen.dist(c2.cen);
		if (dist < abs(c1.r - c2.r) - EPS || dist > c1.r + c2.r + EPS)
			return null;
		double cos = (c1.r * c1.r + dist * dist - c2.r * c2.r) / (2 * c1.r * dist);
		double sin = sqrt(max(0, 1 - cos * cos));
		Point v = c2.cen.sub(c1.cen).mul(c1.r / dist);
		return new Point[] { c1.cen.add(v.rot(cos, sin)), c1.cen.add(v.rot(cos, -sin)) };
	}

	private Point intersect(Line l1, Line l2) {
		double d = l1.a * l2.b - l2.a * l1.b;
		return new Point(-(l1.c * l2.b - l2.c * l1.b) / d, -(l1.a * l2.c - l2.a * l1.c) / d);
	}

	private Point[] intersect(Line l, Circle c) {
		double dist = l.dist(c.cen);
		if (dist > c.r + EPS)
			return null;
		Point C = c.cen;
		Point n = new Point(l.a, l.b);
		Point p1 = C.add(n);
		Point p2 = C.sub(n);
		Point p;
		if (l.dist(p1) < l.dist(p2))
			p = p1;
		else
			p = p2;
		p = p.sub(C).mul(c.r / n.len());
		double cos = dist / c.r;
		double sin = sqrt(max(0, 1 - cos * cos));
		return new Point[] { C.add(p.rot(cos, sin)), C.add(p.rot(cos, -sin)) };
	}

	private Circle getCircle(Circle c1, Circle c2) {
		Point A = c1.cen;
		Point B = c2.cen;
		Point v = B.sub(A);
		double f = c1.r / (c1.r + c2.r);
		Point p1 = A.add(v.mul(f));
		Point p2;
		if (c1.r < c2.r)
			p2 = A.sub(v.mul(c1.r / (c2.r - c1.r)));
		else
			p2 = B.add(v.mul(c2.r / (c1.r - c2.r)));
		Circle c = new Circle((p1.x + p2.x) / 2, (p1.y + p2.y) / 2, p1.dist(p2) / 2);
		return c;
	}

	private Line getLine(Circle c1, Circle c2) {
		Line line = new Line(c1.cen.x, c1.cen.y, c2.cen.x, c2.cen.y);
		return line.getNormal((c1.cen.x + c2.cen.x) / 2, (c1.cen.y + c2.cen.y) / 2);
	}

	void chk(boolean b) {
		if (b)
			return;
		System.out.println(new Error().getStackTrace()[1]);
		exit(999);
	}
	void deb(String fmt, Object... args) {
		System.out.printf(Locale.US, fmt + "%n", args);
	}
	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;
	}
}