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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
const int mod = inf + 7;
const double eps = 1e-9;
const double pi = acos(-1.0);
const int maxn = (int)1e5 + 11;
struct Point {
  double x, y;
  Point() {}
  Point(double x, double y) : x(x), y(y) {}
  void read() { cin >> x >> y; }
  void print() { printf("%.6lf %.6lf\n", x, y); }
  void rotate() {
    double xx = -y;
    double yy = x;
    x = xx;
    y = yy;
  }
  double dist(Point o) {
    return sqrt(((o.x - x) * (o.x - x)) + ((o.y - y) * (o.y - y)));
  }
  void unit() {
    double v = sqrt(((x) * (x)) + ((y) * (y)));
    x /= v;
    y /= v;
  }
  Point const operator+(Point o) { return Point(x + o.x, y + o.y); }
  Point const operator-(Point o) { return Point(x - o.x, y - o.y); }
  Point const operator*(double k) { return Point(x * k, y * k); }
  Point const operator/(double k) { return Point(x / k, y / k); }
};
struct Line {
  double a, b, c;
  Line() {}
  Line(double a, double b, double c) : a(a), b(b), c(c) {}
  Line(Point p, Point q) {
    a = q.y - p.y;
    b = p.x - q.x;
    c = -a * p.x - b * p.y;
  }
  double dist(Point p) {
    return abs(a * p.x + b * p.y + c) / sqrt(((a) * (a)) + ((b) * (b)));
  }
  void invert() {
    a = -a;
    b = -b;
    c = -c;
  }
  void print() { printf("%.5lf %.5lf %.5lf\n", a, b, c); }
};
struct Circle {
  Point o;
  double r;
  Circle() {}
  Circle(Point _o, double _r) {
    o = _o;
    r = _r;
  }
  void read() {
    o.read();
    cin >> r;
  }
  double angle(Point a) {
    double d = a.dist(o);
    return r / d;
  }
};
vector<Point> intersect(Circle A, Circle B) {
  double d = A.o.dist(B.o);
  vector<Point> ans;
  if (A.r + B.r < d) return ans;
  if (abs(A.r + B.r - d) < 1e-9) {
    Point v = B.o - A.o;
    v.unit();
    v = v * A.r;
    ans.push_back(A.o + v);
    return ans;
  }
  if (A.r < B.r) return intersect(B, A);
  if (d + B.r < A.r) return ans;
  if (abs(d + B.r - A.r) < 1e-9) {
    Point v = B.o - A.o;
    v.unit();
    v = v * A.r;
    ans.push_back(A.o + v);
    return ans;
  }
  double r1 = A.r;
  double r2 = B.r;
  double x = (r1 * r1 - r2 * r2 + d * d) / 2.0 / d;
  double h = sqrt(r1 * r1 - x * x);
  Point v = B.o - A.o;
  v.unit();
  v = v * x;
  Point T = A.o + v;
  v.rotate();
  v.unit();
  ans.push_back(T + (v * h));
  ans.push_back(T - (v * h));
  return ans;
}
vector<Point> intersect(Line l1, Line l2) {
  vector<Point> ans;
  double det = l1.a * l2.b - l2.a * l1.b;
  if (abs(det) < 1e-9) return ans;
  det = l1.a * l2.b - l2.a * l1.b;
  double x = l2.c * l1.b - l2.b * l1.c;
  double y = l2.a * l1.c - l1.a * l2.c;
  ans.push_back(Point(x / det, y / det));
  return ans;
}
vector<Point> intersect(Circle o, Line l) {
  vector<Point> ans;
  double d = l.dist(o.o);
  if (d > o.r) return ans;
  Line p = Line(-l.b, l.a, 0);
  p.c = -p.a * o.o.x - p.b * o.o.y;
  if (abs(d - o.r) < 1e-9) return intersect(l, p);
  double r = o.r;
  double x = sqrt(((r) * (r)) - ((d) * (d)));
  Point v = Point(l.a, l.b);
  v.unit();
  v = v * d;
  Point temp = o.o + v;
  double new_d = l.dist(temp);
  if (new_d < d) {
    v = Point(-l.b, l.a);
    v.unit();
    ans.push_back(temp + (v * x));
    ans.push_back(temp - (v * x));
  } else {
    v = Point(-l.a, -l.b);
    v.unit();
    v = v * d;
    temp = o.o + v;
    new_d = l.dist(temp);
    v = Point(-l.b, l.a);
    v.unit();
    ans.push_back(temp + (v * x));
    ans.push_back(temp - (v * x));
  }
  return ans;
}
vector<Point> intersect(Line l, Circle o) {
  vector<Point> ans = intersect(o, l);
  return ans;
}
struct Shape {
  Circle o;
  Line l;
  bool type;
  Shape() {}
  Shape(Circle _o, Line _l, bool _toogle) {
    o = _o;
    l = _l;
    type = _toogle;
  }
  Shape(Circle _o) {
    o = _o;
    type = 0;
  }
  Shape(Line _l) {
    l = _l;
    type = 1;
  }
  Shape(Circle a, Circle b) {
    if (abs(a.r - b.r) < 1e-9) {
      Line ans = Line(a.o, b.o);
      Line q = Line(-ans.b, ans.a, ans.c);
      Point P = (a.o + b.o);
      P = P / 2.0;
      q.c = -q.a * P.x - q.b * P.y;
      l = q;
      type = 1;
    } else {
      double k = a.r / b.r;
      if (k < 1.0) {
        swap(a, b);
        k = 1.0 / k;
      }
      double d = a.o.dist(b.o);
      double x = k * d / (k + 1);
      Point v = b.o - a.o;
      v.unit();
      Point A = a.o + (v * x);
      x = k * d / (k - 1);
      Point B = a.o + (v * x);
      Point O = (A + B);
      O = O / 2.0;
      double r = A.dist(B) / 2.0;
      Circle t = Circle(O, r);
      o = t;
      type = 0;
    }
  }
  void print() {
    if (type == 0) {
      printf("Circle: (%.5lf; %.5lf) - %.5lf\n", o.o.x, o.o.y, o.r);
    } else {
      printf("Line:   (%.5lf %.5lf %.5lf)\n", l.a, l.b, l.c);
    }
  }
};
vector<Point> intersect(Shape first, Shape second) {
  if (first.type == 0 && second.type == 0)
    return intersect(first.o, second.o);
  else if (first.type == 1 && second.type == 0)
    return intersect(first.l, second.o);
  else if (first.type == 0 && second.type == 1)
    return intersect(first.o, second.l);
  else
    return intersect(first.l, second.l);
}
Circle A, B, C;
double mx = -1e9;
Point res;
void doIt(Point a) {
  double a1 = A.angle(a);
  double a2 = B.angle(a);
  double a3 = C.angle(a);
  if (abs(a1 - a2) < 1e-9 || abs(a1 - a3) < 1e-9 || abs(a2 - a3) > 1e-9) {
    if (a1 > mx) {
      mx = a1;
      res = a;
    }
  }
}
int main() {
  A.read();
  B.read();
  C.read();
  Shape s1 = Shape(A, B);
  Shape s2 = Shape(B, C);
  vector<Point> ans = intersect(s1, s2);
  for (__typeof(ans.begin()) it = ans.begin(); it != ans.end(); it++) {
    doIt(*it);
  }
  if (mx > 0) res.print();
  return 0;
}