#include <bits/stdc++.h>   using namespace std;   const int N = 1000 + 2;   double x[4], y[4], r[4];   double dx, dy;   double Fun(double dx, double dy) {     double ap[4];     for (int i = 0; i < 3; i++) {       ap[i] =           sqrt(((x[i] - dx) * (x[i] - dx)) + ((y[i] - dy) * (y[i] - dy))) / r[i];     }     double res = 0.0;     for (int i = 0; i < 3; i++) {       res += ((ap[i] - ap[(i + 1) % 3]) * (ap[i] - ap[(i + 1) % 3]));     }     return res;   }   int main() {     dx = dy = 0.0;     for (int i = 0; i < 3; i++) {       scanf( %lf%lf%lf , &x[i], &y[i], &r[i]);       dx += x[i] / 3;       dy += y[i] / 3;     }     double i = 1.0;     while (i > 1e-5) {       if (Fun(dx + i, dy) < Fun(dx, dy))         dx += i;       else if (Fun(dx - i, dy) < Fun(dx, dy))         dx -= i;       else if (Fun(dx, dy + i) < Fun(dx, dy))         dy += i;       else if (Fun(dx, dy - i) < Fun(dx, dy))         dy -= i;       else         i *= 0.75;     }     if (Fun(dx, dy) < 1e-5) printf( %.5lf %.5lf n , dx, dy);     return 0;   }   