#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;

#define pb push_back

const ld pi = 3.14159265358979323846;
const ll INF = 1e18;
const ld eps = 1e-9;

template<typename T>
T chmax(T a, T b) {
    return a > b ? a : b;
}

template<typename T>
T chmin(T a, T b) {
    return a > b ? b : a;
}

struct Circle {
    ld x, y, r, s;
    bool del;
};

int n;
Circle a[120], b[120];

ld dis(ld x1, ld y1, ld x2, ld y2) {
    return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}

ld gettime() {
    ld ret = INF;
    for (int i = 1; i <= n; i++) {
        for (int j = i + 1; j <= n; j++) {
            if (a[i].del || a[j].del) continue;
            ld dist = dis(a[i].x, a[i].y, a[j].x, a[j].y);
            ld sum_r = a[i].r + a[j].r;
            ld delta_r = a[i].s + a[j].s;
            if (delta_r == 0) continue;
            ret = chmin(ret, (dist - sum_r) / delta_r);
        }
    }
    return ret;
}

void expand(ld t) {
    for (int i = 1; i <= n; i++) {
        if (!a[i].del) {
            a[i].r += t * a[i].s;
        }
    }
}

bool touch(Circle x1, Circle x2) {
    return dis(x1.x, x1.y, x2.x, x2.y) <= x1.r + x2.r + eps;
}

void merge() {
    int fi = -1, fj = -1;
    for (int i = 1; i <= n; i++) {
        if (a[i].del) continue;
        for (int j = i + 1; j <= n; j++) {
            if (a[j].del) continue;
            if (touch(a[i], a[j])) {
                fi = i;
                fj = j;
                break;
            }
        }
        if (fi != -1) break;
    }

    Circle now;
    now.x = (a[fi].x + a[fj].x) / 2;
    now.y = (a[fi].y + a[fj].y) / 2;
    now.r = sqrt(a[fi].r * a[fi].r + a[fj].r * a[fj].r);
    now.s = chmax(a[fi].s, a[fj].s);
    now.del = false;

    a[fi].del = true;
    a[fj].del = true;

    bool anyNewMerges = true;
    while (anyNewMerges) {
        anyNewMerges = false;
        int cnt = 1;
        ld total_area = now.r * now.r * pi;
        ld sumX = now.x, sumY = now.y;

        for (int i = 1; i <= n; i++) {
            if (!a[i].del && touch(now, a[i])) {
                sumX += a[i].x;
                sumY += a[i].y;
                total_area += a[i].r * a[i].r * pi;
                now.s = chmax(now.s, a[i].s);
                a[i].del = true;
                cnt++;
                anyNewMerges = true;
            }
        }
        if (cnt > 1) {
            now.x = sumX / cnt;
            now.y = sumY / cnt;
            now.r = sqrt(total_area / pi);
        }
    }

    int m = 0;
    b[m++] = now;
    for (int i = 1; i <= n; i++) {
        if (!a[i].del) b[m++] = a[i];
    }
    for (int i = 0; i < m; i++) {
        a[i + 1] = b[i];
    }
    n = m;
}

void solve() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i].x >> a[i].y >> a[i].r >> a[i].s;
        a[i].del = false;
    }

    while (n > 1) {
        ld t = gettime();
        expand(t);
        merge();
    }

    cout << fixed << setprecision(10) << a[1].x << " " << a[1].y << endl;
    cout << fixed << setprecision(10) << a[1].r << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int t = 1;
    while (t--) {
        solve();
    }

    return 0;
}