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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Collections;

import static java.lang.Math.*;
import static java.util.Arrays.asList;
import static java.util.Comparator.comparing;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        Circle c[] = new Circle[3];
        for (int i = 0; i < 3; i++) {
            String[] f = br.readLine().split(" ");
            c[i] = new Circle(new double[]{Double.parseDouble(f[0]), Double.parseDouble(f[1])}, Double.parseDouble(f[2]));
        }

        Object f1 = getFigure(c[0], c[1]);
        Object f2 = getFigure(c[0], c[2]);
        double ps[][] = intersect(f1, f2);
        if (ps.length == 0)
            return;
        double[] xy = Collections.min(asList(ps), comparing(p -> norm(sub(p, c[0].c))));
        System.out.printf("%.5f %.5f%n", xy[0], xy[1]);
    }

    private static Object getFigure(Circle c1, Circle c2) {
        double[] d = sub(c2.c, c1.c);
        if (eq(c1.r, c2.r))
            return new Line(add(c1.c, mult(d, 0.5)), rot(d));
        double e1 = c1.r / (c1.r + c2.r);
        double e2 = -c1.r / (-c1.r + c2.r);
        return new Circle(add(c1.c, mult(d, (e1 + e2) / 2)), norm(d) * abs(e2 - e1) / 2);
    }

    /////////////////////////////
    // Library functions below //
    /////////////////////////////

    private static double[][] intersect(Object f1, Object f2) {
        if (f1 instanceof Circle && f2 instanceof Circle) {
            Circle c1 = (Circle) f1;
            Circle c2 = (Circle) f2;
            double l = norm(sub(c1.c, c2.c));
            if (eq(l, 0))
                return new double[][]{};
            double x = (1 - sqr(c2.r / l) + sqr(c1.r / l)) / 2;
            double y = sqr(c1.r / l) - sqr(x);
            if (le(y, 0))
                return new double[][]{};
            double xv[] = add(mult(c1.c, 1 - x), mult(c2.c, x));
            if (eq(y, 0))
                return new double[][]{xv};
            y = sqrt(y);
            double yv[] = mult(rot(sub(c1.c, c2.c)), y);
            return new double[][]{add(xv, yv), sub(xv, yv)};
        }
        if (f1 instanceof Circle && f2 instanceof Line)
            return intersect(f2, f1);
        if (f1 instanceof Line && f2 instanceof Circle) {
            Line l = (Line) f1;
            Circle c = (Circle) f2;
            double[] v = mult(l.v, 1 / norm(l.v));
            double[] p = add(l.a, mult(v, dot(sub(c.c, l.a), v)));
            double d = sqr(c.r) - sqr(norm(sub(c.c, p)));
            if (le(d, 0))
                return new double[][]{};
            if (eq(d, 0))
                return new double[][]{p};
            d = sqrt(d);
            return new double[][]{add(p, mult(v, d)), add(p, mult(v, -d))};
        }
        if (f1 instanceof Line && f2 instanceof Line) {
            Line l1 = (Line) f1;
            Line l2 = (Line) f2;
            double a = dot(l1.v, rot(l2.v));
            if (eq(a, 0))
                return new double[][]{};
            return new double[][]{add(l1.a, mult(l1.v, dot(sub(l2.a, l1.a), rot(l2.v)) / a))};
        }
        throw new RuntimeException();
    }

    private static double dot(double[] a, double[] b) {
        return a[0] * b[0] + a[1] * b[1];
    }

    private static double norm(double[] a) {
        return Math.hypot(a[0], a[1]);
    }

    private static double[] rot(double[] a) {
        return new double[]{-a[1], a[0]};
    }

    private static double[] mult(double[] a, double b) {
        return new double[]{a[0] * b, a[1] * b};
    }

    private static double[] sub(double[] a, double[] b) {
        return new double[]{a[0] - b[0], a[1] - b[1]};
    }

    private static double[] add(double[] a, double[] b) {
        return new double[]{a[0] + b[0], a[1] + b[1]};
    }

    private static double sqr(double t) {
        return t * t;
    }

    private static final double THR = 1e-10;

    private static boolean le(double a, double b) {
        return a + THR < b;
    }

    private static boolean eq(double a, double b) {
        return abs(a - b) < THR;
    }

    private static class Circle {
        double[] c;
        double r;

        public Circle(double[] c, double r) {
            this.c = c;
            this.r = r;
        }
    }

    private static class Line {
        double[] a, v;

        public Line(double[] a, double[] v) {
            this.a = a;
            this.v = v;
        }
    }
}