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;
struct Point {
  long double x, y;
  Point operator-(const Point p) { return {x - p.x, y - p.y}; }
  Point operator+(const Point p) { return {x + p.x, y + p.y}; }
  Point operator*(const long double k) { return {x * k, y * k}; }
  Point operator/(const long double k) { return {x / k, y / k}; }
};
long double cross(Point p, Point q) { return p.x * q.y - p.y * q.x; }
long double dot(Point p, Point q) { return p.x * q.x + p.y * q.y; }
Point rotate(Point p, long double theta) {
  Point dir = {cos(theta), sin(theta)};
  return {p.x * dir.x - p.y * dir.y, p.x * dir.y + p.y * dir.x};
}
Point rotate90(Point p) { return {p.y, -p.x}; }
long double norm(Point v) { return sqrt(dot(v, v)); }
long double sdist(Point p, Point q) { return dot(p - q, p - q); }
Point reScaling(Point p, long double k) { return (p / norm(p)) * k; }
Point proy(Point p, Point q) { return (p * dot(p, q)) / dot(p, p); }
const long double eps = 1e-7;
vector<Point> capCC(Point c1, long double r1, Point c2, long double r2) {
  vector<Point> ans;
  long double max_dis = r1 + r2;
  long double sd = sdist(c1, c2);
  long double asrt = max_dis * max_dis - sd;
  if (asrt > 0 and sqrt(sd) + min(r1, r2) >= max(r1, r2)) {
    long double theta = acos((sd + r1 * r1 - r2 * r2) / 2.l / r1 / sqrt(sd));
    Point v = reScaling(c2 - c1, r1);
    Point vl = rotate(v, theta) + c1;
    ans.emplace_back(vl);
    Point vr = rotate(v, -theta) + c1;
    ans.emplace_back(vr);
  }
  return ans;
}
void PP2Line(Point p, Point q, long double& a, long double& b, long double& c) {
  a = p.y - q.y;
  b = q.x - p.x;
  c = cross(p, q);
}
vector<Point> capLC(Point c1, long double r1, Point p, Point q) {
  long double a, b, c;
  PP2Line(p, q, a, b, c);
  Point dir = {a, b};
  long double dis = abs(dot(dir, c1) + c) / norm(dir);
  vector<Point> ans;
  if (dis < r1) {
    Point s = q + proy(p - q, c1 - q);
    Point v = rotate90(dir);
    v = reScaling(v, sqrt(r1 * r1 - dis * dis));
    Point vl = s - v;
    ans.emplace_back(vl);
    Point vr = s + v;
    ans.emplace_back(vr);
  }
  return ans;
}
vector<Point> capLL(Point p1, Point q1, Point p2, Point q2) {
  long double a1, b1, c1;
  PP2Line(p1, q1, a1, b1, c1);
  long double a2, b2, c2;
  PP2Line(p2, q2, a2, b2, c2);
  vector<Point> ans;
  long double det = cross({a1, b1}, {a2, b2});
  if (abs(det) > eps) {
    long double x1 = cross({a1, -c1}, {a2, -c2}) / det;
    long double x2 = cross({-c1, b1}, {-c2, b2}) / det;
    ans.push_back({x2, x1});
  }
  return ans;
}
void toL(long double a, long double b, long double c, Point& p, Point& q) {
  if (abs(a) < eps) {
    p = {0.L, -c / b};
    q = {1.L, -c / b};
  } else if (abs(b) < eps) {
    p = {-c / a, 0.L};
    q = {-c / a, 1.L};
  } else {
    p = {0.L, -c / b};
    q = {-c / a, 0.L};
  }
}
void toC(long double c, long double d, long double e, Point& C,
         long double& r) {
  C = {-c / 2, -d / 2};
  r = sqrt(c * c + d * d - 4.L * e) / 2.L;
}
void initL(Point c1, Point c2, Point& p, Point& q) {
  long double a = 2 * (c2.x - c1.x);
  long double b = 2 * (c2.y - c1.y);
  long double c = c1.x * c1.x - c2.x * c2.x + c1.y * c1.y - c2.y * c2.y;
  toL(a, b, c, p, q);
}
void initC(Point c1, long double r1, Point c2, long double r2, Point& C,
           long double& r) {
  long double k = r2 * r2 - r1 * r1;
  long double c = 2 * (c2.x * r1 * r1 - c1.x * r2 * r2);
  long double d = 2 * (c2.y * r1 * r1 - c1.y * r2 * r2);
  long double e = (c1.x * c1.x + c1.y * c1.y) * r2 * r2 -
                  (c2.x * c2.x + c2.y * c2.y) * r1 * r1;
  toC(c / k, d / k, e / k, C, r);
}
int main() {
  Point c[3];
  int r[3];
  for (int i = 0; i < 3; ++i) {
    cin >> c[i].x >> c[i].y >> r[i];
  }
  vector<Point> ans;
  if (r[0] == r[1]) {
    Point p1, p2;
    initL(c[0], c[1], p1, p2);
    if (r[1] == r[2]) {
      Point q1, q2;
      initL(c[1], c[2], q1, q2);
      ans = capLL(p1, p2, q1, q2);
    } else {
      Point c1;
      long double r1;
      initC(c[1], r[1], c[2], r[2], c1, r1);
      ans = capLC(c1, r1, p1, p2);
    }
  } else {
    Point c2;
    long double r2;
    initC(c[0], r[0], c[1], r[1], c2, r2);
    if (r[1] == r[2]) {
      Point q1, q2;
      initL(c[1], c[2], q1, q2);
      ans = capLC(c2, r2, q1, q2);
    } else {
      Point c1;
      long double r1;
      initC(c[1], r[1], c[2], r[2], c1, r1);
      ans = capCC(c1, r1, c2, r2);
    }
  }
  if (not ans.empty()) {
    long double mx = 1e18;
    Point x;
    for (int i = 0; i < ans.size(); ++i) {
      if (mx > sdist(ans[i], c[0])) {
        mx = sdist(ans[i], c[0]);
        x = ans[i];
      }
    }
    cout << setprecision(7) << fixed << x.x << " " << x.y << endl;
  }
  return 0;
}