#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 10;
const double EPS = 1e-6;
int x[MAX_N], y[MAX_N], r[MAX_N];
double sqr(double a) { return a * a; }
struct Pnt {
  double x, y;
  Pnt() : x(0), y(0) {}
  Pnt(double _x, double _y) : x(_x), y(_y) {}
  inline Pnt operator+(const Pnt &B) const { return Pnt(x + B.x, y + B.y); }
  inline Pnt operator-(const Pnt &B) const { return Pnt(x - B.x, y - B.y); }
  inline double operator*(const Pnt &B) const { return x * B.x + y * B.y; }
  inline double operator%(const Pnt &B) const { return x * B.y - y * B.x; }
  inline Pnt operator*(double k) const { return Pnt(x * k, y * k); }
  inline Pnt operator/(double k) const { return Pnt(x / k, y / k); }
  inline Pnt operator-() const { return Pnt(-x, -y); }
  inline void operator+=(const Pnt &B) { x += B.x, y += B.y; }
  inline void operator-=(const Pnt &B) { x -= B.x, y -= B.y; }
  inline void operator*=(double k) { x *= k, y *= k; }
  inline bool operator==(const Pnt &B) {
    return abs(x - B.x) <= EPS && abs(y - B.y) <= EPS;
  }
  inline bool operator!=(const Pnt &B) {
    return abs(x - B.x) > EPS || abs(y - B.y) > EPS;
  }
  inline bool operator<(const Pnt &B) {
    return abs(x - B.x) <= EPS ? y < B.y - EPS : x < B.x;
  }
  inline double angle() const { return atan2(y, x); }
  inline double len2() const { return x * x + y * y; }
  inline double len() const { return sqrt(x * x + y * y); }
  inline Pnt getNorm() const {
    auto l = len();
    return Pnt(x / l, y / l);
  }
  inline void normalize() {
    auto l = len();
    x /= l, y /= l;
  }
  inline Pnt getRot90() const { return Pnt(-y, x); }
  inline Pnt getRot(double a) const {
    double si = sin(a), co = cos(a);
    return Pnt(x * co - y * si, x * si + y * co);
  }
  inline void read() {
    int _x, _y;
    scanf("%d%d", &_x, &_y);
    x = _x, y = _y;
  }
};
vector<Pnt> v;
struct Line {
  double a, b, c;
  Line() : a(0), b(0), c(0) {}
  Line(Pnt p, double _c) : a(p.x), b(p.y), c(_c) {}
  Line(double _a, double _b, double _c) : a(_a), b(_b), c(_c) {}
  Line(const Pnt &A, const Pnt &B) {
    Pnt n = (B - A).getRot90().getNorm();
    a = n.x, b = n.y, c = -(a * A.x + b * A.y);
  }
  inline double d(const Pnt &p) const {
    return (a * p.x + b * p.y + c) / sqrt(a * a + b * b);
  }
  inline Pnt no() const { return Pnt(a, b); }
  inline Pnt normalToP(const Pnt &p) const {
    return Pnt(a, b) * (a * p.x + b * p.y + c);
  }
};
struct Circle {
  Pnt p;
  double r;
  Circle() : r(0) {}
  Circle(double x, double y, double r) : p(Pnt(x, y)), r(r) {}
};
Line line[2];
Circle circle[2];
int type[2];
int line_line(const Line &l, const Line &m) {
  double z = m.a * l.b - l.a * m.b, x = m.c * l.b - l.c * m.b,
         y = m.c * l.a - l.c * m.a;
  if (fabs(z) > EPS) {
    v.push_back(Pnt(-x / z, y / z));
    return 1;
  } else if (fabs(x) > EPS || fabs(y) > EPS)
    return 0;
  else
    return 2;
}
void circle_line(const Circle &c, const Line &l) {
  Line l2 = l;
  double q = sqrt(l.a * l.a + l.b * l.b);
  l2.a /= q, l2.b /= q, l2.c /= q;
  double d = l2.d(c.p);
  if (fabs(d) > c.r + EPS) return;
  if (fabs(fabs(d) / c.r - 1) < EPS)
    v.push_back(c.p - l2.no() * d);
  else {
    double s = sqrt(fabs(sqr(c.r) - sqr(d)));
    v.push_back(c.p - l2.no() * d + l2.no().getRot90() * s);
    v.push_back(c.p - l2.no() * d - l2.no().getRot90() * s);
  }
}
void circle_circle(const Circle &a, const Circle &b) {
  circle_line(
      a, Line((b.p - a.p) * 2, a.p.len2() - b.p.len2() + sqr(b.r) - sqr(a.r)));
}
void print() {
  double maxx = 0;
  Pnt ans;
  for (auto &p : v) {
    double d =
        r[0] / sqrt((p.x - x[0]) * (p.x - x[0]) + (p.y - y[0]) * (p.y - y[0]));
    if (d > maxx) maxx = d, ans = p;
  }
  if (maxx > 0) printf("%.20f %.20f\n", ans.x, ans.y);
}
int main() {
  for (int i = 0; (i) < (3); ++i) scanf("%d%d%d", &x[i], &y[i], &r[i]);
  for (int i = (1); (i) < (3); ++i) {
    int k = sqr(r[i]) - sqr(r[0]);
    long long a = 2 * (sqr(r[0]) * x[i] - sqr(r[i]) * x[0]);
    long long b = 2 * (sqr(r[0]) * y[i] - sqr(r[i]) * y[0]);
    long long c = sqr(r[i]) * sqr(x[0]) + sqr(r[i]) * sqr(y[0]) -
                  sqr(r[0]) * sqr(x[i]) - sqr(r[0]) * sqr(y[i]);
    if (k == 0) {
      type[i - 1] = 0;
      line[i - 1] = Line(a, b, c);
    } else {
      double a0 = a * 1. / k;
      double b0 = b * 1. / k;
      double c0 = c * 1. / k;
      double sqR = (a0 * a0 + b0 * b0) / 4 - c0;
      type[i - 1] = 1;
      assert(sqR > 0);
      circle[i - 1] = Circle(-a0 / 2, -b0 / 2, sqrt(sqR));
    }
  }
  if (type[0] == 0 && type[1] == 0) line_line(line[0], line[1]);
  if (type[0] == 0 && type[1] == 1) circle_line(circle[1], line[0]);
  if (type[0] == 1 && type[1] == 0) circle_line(circle[0], line[1]);
  if (type[0] == 1 && type[1] == 1) circle_circle(circle[0], circle[1]);
  print();
  return 0;
}

### Prompt

Create a solution in Cpp for the following 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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 10;
const double EPS = 1e-6;
int x[MAX_N], y[MAX_N], r[MAX_N];
double sqr(double a) { return a * a; }
struct Pnt {
  double x, y;
  Pnt() : x(0), y(0) {}
  Pnt(double _x, double _y) : x(_x), y(_y) {}
  inline Pnt operator+(const Pnt &B) const { return Pnt(x + B.x, y + B.y); }
  inline Pnt operator-(const Pnt &B) const { return Pnt(x - B.x, y - B.y); }
  inline double operator*(const Pnt &B) const { return x * B.x + y * B.y; }
  inline double operator%(const Pnt &B) const { return x * B.y - y * B.x; }
  inline Pnt operator*(double k) const { return Pnt(x * k, y * k); }
  inline Pnt operator/(double k) const { return Pnt(x / k, y / k); }
  inline Pnt operator-() const { return Pnt(-x, -y); }
  inline void operator+=(const Pnt &B) { x += B.x, y += B.y; }
  inline void operator-=(const Pnt &B) { x -= B.x, y -= B.y; }
  inline void operator*=(double k) { x *= k, y *= k; }
  inline bool operator==(const Pnt &B) {
    return abs(x - B.x) <= EPS && abs(y - B.y) <= EPS;
  }
  inline bool operator!=(const Pnt &B) {
    return abs(x - B.x) > EPS || abs(y - B.y) > EPS;
  }
  inline bool operator<(const Pnt &B) {
    return abs(x - B.x) <= EPS ? y < B.y - EPS : x < B.x;
  }
  inline double angle() const { return atan2(y, x); }
  inline double len2() const { return x * x + y * y; }
  inline double len() const { return sqrt(x * x + y * y); }
  inline Pnt getNorm() const {
    auto l = len();
    return Pnt(x / l, y / l);
  }
  inline void normalize() {
    auto l = len();
    x /= l, y /= l;
  }
  inline Pnt getRot90() const { return Pnt(-y, x); }
  inline Pnt getRot(double a) const {
    double si = sin(a), co = cos(a);
    return Pnt(x * co - y * si, x * si + y * co);
  }
  inline void read() {
    int _x, _y;
    scanf("%d%d", &_x, &_y);
    x = _x, y = _y;
  }
};
vector<Pnt> v;
struct Line {
  double a, b, c;
  Line() : a(0), b(0), c(0) {}
  Line(Pnt p, double _c) : a(p.x), b(p.y), c(_c) {}
  Line(double _a, double _b, double _c) : a(_a), b(_b), c(_c) {}
  Line(const Pnt &A, const Pnt &B) {
    Pnt n = (B - A).getRot90().getNorm();
    a = n.x, b = n.y, c = -(a * A.x + b * A.y);
  }
  inline double d(const Pnt &p) const {
    return (a * p.x + b * p.y + c) / sqrt(a * a + b * b);
  }
  inline Pnt no() const { return Pnt(a, b); }
  inline Pnt normalToP(const Pnt &p) const {
    return Pnt(a, b) * (a * p.x + b * p.y + c);
  }
};
struct Circle {
  Pnt p;
  double r;
  Circle() : r(0) {}
  Circle(double x, double y, double r) : p(Pnt(x, y)), r(r) {}
};
Line line[2];
Circle circle[2];
int type[2];
int line_line(const Line &l, const Line &m) {
  double z = m.a * l.b - l.a * m.b, x = m.c * l.b - l.c * m.b,
         y = m.c * l.a - l.c * m.a;
  if (fabs(z) > EPS) {
    v.push_back(Pnt(-x / z, y / z));
    return 1;
  } else if (fabs(x) > EPS || fabs(y) > EPS)
    return 0;
  else
    return 2;
}
void circle_line(const Circle &c, const Line &l) {
  Line l2 = l;
  double q = sqrt(l.a * l.a + l.b * l.b);
  l2.a /= q, l2.b /= q, l2.c /= q;
  double d = l2.d(c.p);
  if (fabs(d) > c.r + EPS) return;
  if (fabs(fabs(d) / c.r - 1) < EPS)
    v.push_back(c.p - l2.no() * d);
  else {
    double s = sqrt(fabs(sqr(c.r) - sqr(d)));
    v.push_back(c.p - l2.no() * d + l2.no().getRot90() * s);
    v.push_back(c.p - l2.no() * d - l2.no().getRot90() * s);
  }
}
void circle_circle(const Circle &a, const Circle &b) {
  circle_line(
      a, Line((b.p - a.p) * 2, a.p.len2() - b.p.len2() + sqr(b.r) - sqr(a.r)));
}
void print() {
  double maxx = 0;
  Pnt ans;
  for (auto &p : v) {
    double d =
        r[0] / sqrt((p.x - x[0]) * (p.x - x[0]) + (p.y - y[0]) * (p.y - y[0]));
    if (d > maxx) maxx = d, ans = p;
  }
  if (maxx > 0) printf("%.20f %.20f\n", ans.x, ans.y);
}
int main() {
  for (int i = 0; (i) < (3); ++i) scanf("%d%d%d", &x[i], &y[i], &r[i]);
  for (int i = (1); (i) < (3); ++i) {
    int k = sqr(r[i]) - sqr(r[0]);
    long long a = 2 * (sqr(r[0]) * x[i] - sqr(r[i]) * x[0]);
    long long b = 2 * (sqr(r[0]) * y[i] - sqr(r[i]) * y[0]);
    long long c = sqr(r[i]) * sqr(x[0]) + sqr(r[i]) * sqr(y[0]) -
                  sqr(r[0]) * sqr(x[i]) - sqr(r[0]) * sqr(y[i]);
    if (k == 0) {
      type[i - 1] = 0;
      line[i - 1] = Line(a, b, c);
    } else {
      double a0 = a * 1. / k;
      double b0 = b * 1. / k;
      double c0 = c * 1. / k;
      double sqR = (a0 * a0 + b0 * b0) / 4 - c0;
      type[i - 1] = 1;
      assert(sqR > 0);
      circle[i - 1] = Circle(-a0 / 2, -b0 / 2, sqrt(sqR));
    }
  }
  if (type[0] == 0 && type[1] == 0) line_line(line[0], line[1]);
  if (type[0] == 0 && type[1] == 1) circle_line(circle[1], line[0]);
  if (type[0] == 1 && type[1] == 0) circle_line(circle[0], line[1]);
  if (type[0] == 1 && type[1] == 1) circle_circle(circle[0], circle[1]);
  print();
  return 0;
}

```