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 double ep = 1e-8;
struct pnt {
  double x, y;
  pnt(double x = 0, double y = 0) : x(x), y(y) {}
  pnt operator+(const pnt &b) { return pnt(x + b.x, y + b.y); }
  pnt operator-(const pnt &b) { return pnt(x - b.x, y - b.y); }
  pnt operator*(const double &b) { return pnt(x * b, y * b); }
  pnt operator/(const double &b) { return pnt(x / b, y / b); }
  double operator&(const pnt &b) { return x * b.x + y * b.y; }
  double operator^(const pnt &b) { return x * b.y - b.x * y; }
  bool operator==(const pnt &b) {
    return abs(x - b.x) < ep && abs(y - b.y) < ep;
  }
  pnt rot() { return pnt(-y, x); }
  double dist() { return sqrt(x * x + y * y); }
  void input() { scanf("%lf %lf", &x, &y); }
  void print() { cout << fixed << setprecision(10) << x << " " << y << endl; }
} p[3], Q, o[3], oo[3];
double r[3], R[3];
int get_circle(pnt p1, double r1, pnt p2, double r2, pnt &o, pnt &oo,
               double &r) {
  if (abs(r1 - r2) < ep) {
    o = (p1 + p2) * 0.5;
    oo = o + (p2 - p1).rot();
    return 1;
  }
  pnt A = (p1 * r2 + p2 * r1) / (r1 + r2);
  pnt B = (p1 * r2 - p2 * r1) / (r2 - r1);
  o = (A + B) * 0.5;
  r = (o - A).dist();
  return 2;
}
struct data {
  pnt o, oo;
  double r;
  int type;
  data(pnt o, pnt oo, double r, int type) : o(o), oo(oo), r(r), type(type) {}
  void print() {
    cout << endl << " :: type - " << type << endl;
    o.print();
    if (type == 1)
      oo.print();
    else
      cout << r << endl;
    cout << "--------------" << endl;
  }
};
void get_point_on_two_line(pnt a, pnt b, pnt c, pnt d, pnt &rlt) {
  double s = a - b ^ c - d;
  double x = (a - d ^ c - d) / s;
  rlt = a * (1 - x) + b * x;
}
int get_ponint_on_line_circle(pnt a, pnt b, pnt c, double r, pnt *rlt) {
  double len = (a - b).dist();
  double d = fabs(a - c ^ b - c) / len;
  double dx = sqrt(r * r - d * d);
  double x = (c - a & b - a) / len;
  double ax = (x - dx) / len, bx = (x + dx) / len;
  rlt[0] = a * (1 - ax) + b * ax;
  rlt[1] = a * (1 - bx) + b * bx;
  return d <= r - ep ? 2 : 1;
}
int get_point_on_two_circle(pnt c1, double r1, pnt c2, double r2, pnt *rlt) {
  double d = (c1 - c2).dist();
  if (r1 + r2 < d || r1 + d < r2 || r2 + d < r1) return 0;
  double x = (r1 * r1 - r2 * r2 + d * d) / (d * 2);
  pnt v = (c2 - c1) / d;
  pnt cp = c1 + v * x;
  if (fabs(r1 + r2 - d) < ep || fabs(r1 + d - r2) < ep ||
      fabs(r2 + d - r1) < ep) {
    rlt[0] = cp;
    return 1;
  }
  double h = sqrt(r1 * r1 - x * x);
  pnt dv = v.rot() * h;
  rlt[0] = cp - dv, rlt[1] = cp + dv;
  return 2;
}
int main() {
  for (int i = 0; i < 3; i++) p[i].input(), scanf("%lf", &r[i]);
  vector<data> vec;
  for (int i = 0; i < 3; i++) {
    int j = (i + 1) % 3;
    int type = get_circle(p[i], r[i], p[j], r[j], o[i], oo[i], R[i]);
    vec.push_back(data(o[i], oo[i], R[i], type));
  }
  vector<pnt> A;
  pnt rlt[10];
  for (int i = 0; i < 3; i++) {
    for (int j = i + 1; j < 3; j++) {
      if (vec[i].type == 1 && vec[j].type == 1) {
        get_point_on_two_line(vec[i].o, vec[i].oo, vec[j].o, vec[j].oo, rlt[0]);
        A.emplace_back(rlt[0]);
      }
      if (vec[i].type == 1 && vec[j].type == 2) {
        int k = get_ponint_on_line_circle(vec[i].o, vec[i].oo, vec[j].o,
                                          vec[j].r, rlt);
        for (int i = 0; i < k; i++) A.emplace_back(rlt[i]);
      }
      if (vec[i].type == 2 && vec[j].type == 2) {
        int k = get_point_on_two_circle(vec[i].o, vec[i].r, vec[j].o, vec[j].r,
                                        rlt);
        for (int i = 0; i < k; i++) A.emplace_back(rlt[i]);
      }
      if (vec[i].type == 2 && vec[j].type == 1) {
        int k = get_ponint_on_line_circle(vec[j].o, vec[j].oo, vec[i].o,
                                          vec[i].r, rlt);
        for (int i = 0; i < k; i++) A.emplace_back(rlt[i]);
      }
    }
  }
  pnt Q;
  double md = 1e9;
  for (int i = 0; i < A.size(); i++) {
    int cnt = 0;
    for (int j = 0; j < A.size(); j++)
      if (A[i] == A[j]) cnt++;
    if (cnt >= 3 && md > (A[i] - p[0]).dist()) {
      md = (A[i] - p[0]).dist();
      Q = A[i];
    }
  }
  if (md < 1e9) Q.print();
  return 0;
}