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.*;
import java.util.*;
import java.lang.*;
import java.io.*;
import java.math.*;


public class Main {
	static final double EPS = 1e-6;
	
	static class Point {
		double x, y;
		
		Point(double x, double y) {
			this.x = x;
			this.y = y;
		}
		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);
		}
		Point mul(double f) {
			return new Point(x * f, y * f);
		}
		Point rotate(double cos, double sin) {
			return new Point(x * cos - y * sin, x * sin + y * cos);
		}
		double len() {
			return Math.hypot(x, y);
		}
		double dist(Point p) {
			return Math.hypot(x - p.x, y - p.y);
		}
		public String toString() {
			return x + " " + y;
		}
	}

	static 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 Math.abs(a * p.x + b * p.y + c) / Math.sqrt(a * a + b * b);
		}
		public String toString() {
			return a + " " + b + " " + c;
		}
	}

	static class Circle {
		Point center;
		double r;
		Circle(double x, double y, double r) {
			center = new Point(x, y);
			this.r = r;
		}
		public String toString() {
			return center + " " + r;
		}
	}

	public static void main(String[] args) throws IOException {
		Scanner input = new Scanner(System.in);
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(System.out);
		Circle c1, c2, c3;
		c1 = new Circle(input.nextInt(), input.nextInt(), input.nextInt());
		c2 = new Circle(input.nextInt(), input.nextInt(), input.nextInt());
		c3 = new Circle(input.nextInt(), input.nextInt(), input.nextInt());
		Point res = null;
		if (c1.r == c2.r) {
			if (c1.r == c3.r) {
				res = intersect(getLine(c1, c2), getLine(c1, c3));
			} else {
				res = getBest(intersect(getCircle(c1, c3), getLine(c1, c2)), c1);
			}
		} else {
			if (c1.r == c3.r) {
				res = getBest(intersect(getCircle(c1, c2), getLine(c1, c3)), c1);
			} else {
				res = getBest(intersect(getCircle(c1, c2), getCircle(c1, c3)), c1);
			}
		}
		if (res != null)
			out.printf("%.6f %.6f", res.x, res.y);
		out.close();
	}
	
	static Line getLine(Circle c1, Circle c2) {
		return new Line(c1.center.x, c1.center.y, c2.center.x, c2.center.y).getNormal((c1.center.x + c2.center.x) / 2, (c1.center.y + c2.center.y) / 2);
	}
	
	static Circle getCircle(Circle c1, Circle c2) {
		Point vectorAB = c2.center.sub(c1.center);
		double factor = c1.r / (c1.r + c2.r);
		Point p1 = c1.center.add(vectorAB.mul(factor));
		Point p2;
		if (c1.r < c2.r) {
			p2 = c1.center.sub(vectorAB.mul(c1.r / (c2.r - c1.r)));
		} else {
			p2 = c2.center.add(vectorAB.mul(c2.r / (c1.r - c2.r)));
		}
		return new Circle((p1.x + p2.x) / 2, (p1.y + p2.y) / 2, p1.dist(p2) / 2);
	}
	
	static Point getBest(Point[] p, Circle c) {
		if (p == null) 
			return null;
		double minD = 1e30;
		Point ret = null;
		for (int i = 0; i < p.length; ++i) {
			if (minD > c.center.dist(p[i])) {
				minD = c.center.dist(p[i]);
				ret = p[i];
			}
		}
		return ret;
	}
	
	static Point[] intersect(Circle c1, Circle c2) {
		double distAB = c1.center.dist(c2.center);
		Point vector = c2.center.sub(c1.center).mul(c1.r / distAB);
		if (Math.abs(c1.r - c2.r) - distAB > EPS || distAB - (c1.r + c2.r) > EPS)
			return null;
		double cos = (c1.r * c1.r + distAB * distAB - c2.r * c2.r) / (2 * c1.r * distAB);
		double sin = Math.sqrt(1 - cos * cos);
		return new Point[] { c1.center.add(vector.rotate(cos, sin)), c1.center.add(vector.rotate(cos, -sin)) };
	}
	
	static Point[] intersect(Circle c, Line l) {
		double dist = l.dist(c.center);
		if (dist > c.r) return null;
		Point vectorN = new Point(l.a, l.b);
		Point p1 = c.center.add(vectorN);
		Point p2 = c.center.sub(vectorN);
		Point p = null;
		if (l.dist(p1) < l.dist(p2))
			p = p1;
		else 
			p = p2;
		Point vector = p.sub(c.center).mul(c.r / vectorN.len());
		double cos = dist / c.r;
		double sin = Math.sqrt(1 - cos * cos);
		return new Point[] { c.center.add(vector.rotate(cos, sin)), c.center.add(vector.rotate(cos, -sin)) };
	}
	
	static Point intersect(Line l1, Line l2) {
		double d = l1.a * l2.b - l1.b * l2.a;
		double dx = l1.b * l2.c - l1.c * l2.b;
		double dy = l1.c * l2.a - l1.a * l2.c;
		return new Point(dx / d, dy / d);
	}
	
	void check(boolean b) {
		if (b)
			return;
		System.out.println(new Error().getStackTrace()[1]);
		System.exit(999);
	}
}