#include <bits/stdc++.h>
using namespace std;
const long double EPS = 1e-12, D = 1.0 / 30;
long double x[3], y[3], r[3];
long double f2(long double x_cur, long double y_cur) {
  long double ans = 0;
  long double avg = 0;
  for (int i = 0; i < 3; ++i) {
    long double cur = hypot(x_cur - x[i], y_cur - y[i]) / r[i];
    avg += cur;
  }
  avg /= 3;
  for (int i = 0; i < 3; ++i) {
    long double cur = hypot(x_cur - x[i], y_cur - y[i]) / r[i];
    ans += pow(cur - avg, 2);
  }
  return ans / avg;
}
long double f1(long double x_cur, long double y_cur) {
  long double dist = 0;
  for (int i = 0; i < 3; ++i)
    dist = max(hypot(x_cur - x[i], y_cur - y[i]) / r[i], dist);
  return dist;
}
long double x_opt = 460, y_opt = -165;
long double w = 30;
long double total(long double x_cur, long double y_cur) {
  return w * f1(x_cur, y_cur) + f2(x_cur, y_cur);
}
void info(long double x_cur, long double y_cur) {
  cout << x_cur << ' ' << y_cur << " : " << f1(x_cur, y_cur) << ' '
       << f2(x_cur, y_cur) << ' ' << total(x_cur, y_cur) << '\n';
}
long double x_ans = 0, y_ans = 0;
void run(long double _w) {
  w = _w;
  long double x_opt = 460, y_opt = -165;
  for (long double d = 2000; d >= EPS; d /= 2) {
    w = max((long double)0.0, w / 2.0);
    long double change = d * D;
    long double x_new = x_opt;
    long double y_new = y_opt;
    for (long double x_cur = x_opt - d; x_cur <= x_opt + d; x_cur += change)
      for (long double y_cur = y_opt - d; y_cur <= y_opt + d; y_cur += change)
        if (total(x_cur, y_cur) < total(x_new, y_new)) {
          x_new = x_cur;
          y_new = y_cur;
        }
    if (total(x_new, y_new) < total(x_opt, y_opt)) {
      x_opt = x_new;
      y_opt = y_new;
    }
  }
  if (f2(x_opt, y_opt) < EPS && total(x_opt, y_opt) < total(x_ans, y_ans)) {
    x_ans = x_opt;
    y_ans = y_opt;
  }
}
int main() {
  cout << fixed << setprecision(12);
  for (int i = 0; i < 3; ++i) cin >> x[i] >> y[i] >> r[i];
  run(0);
  run(10);
  run(30);
  if (f2(x_ans, y_ans) < EPS) cout << x_ans << ' ' << y_ans << '\n';
}
