#include <bits/stdc++.h>

using namespace std;

#define N 110
#define eps 1e-8

struct circle
{
    double x, y;
    double r;
    double s;
    int id;
};

vector<circle> S;

double dist(circle &c1, circle &c2)
{
    return sqrt((c1.x - c2.x) * (c1.x - c2.x) + (c1.y - c2.y) * (c1.y - c2.y)) - sqrt((c1.r + c2.r) * (c1.r + c2.r));
}

bool intersect(circle &c1, circle &c2)
{
    return dist(c1, c2) < eps;
}

double getT()
{
    double t = 1e18;
    for (circle &c1 : S)
    {
        for (circle &c2 : S)
        {
            if (c1.id == c2.id)
                continue;
            t = min(t, dist(c1, c2) / (c1.s + c2.s));
        }
    }
    return t;
}

void addT(double t)
{
    for (circle &c : S)
        c.r += c.s * t;
}

int f[N];

int getf(int k)
{
    if (f[k] == k)
        return k;
    return f[k] = getf(f[k]);
}

void qmerge(int a, int b)
{
    int t1 = getf(a);
    int t2 = getf(b);
    if (t1 != t2)
        f[t1] = t2;
}

circle temp[N];
int cntf[N];

void merge()
{
    int sz = S.size();
    for (int i = 0; i < N; i++)
        f[i] = i;

    for (circle &c1 : S)
    {
        for (circle &c2 : S)
        {
            if (c1.id == c2.id)
                continue;
            if (intersect(c1, c2))
            {
                qmerge(c1.id, c2.id);
            }
        }
    }
    // todo

    for (int i = 1; i <= sz; i++)
    {
        temp[i].id = i;
        temp[i].r = 0;
        temp[i].x = 0;
        temp[i].y = 0;
        temp[i].s = 0;
        cntf[i] = 0;
    }

    for (circle &c : S)
    {
        int fa = getf(c.id);
        temp[fa].x += c.x;
        temp[fa].y += c.y;
        temp[fa].r += c.r * c.r;
        temp[fa].s = max(temp[fa].s, c.s);
        cntf[fa]++;
    }

    S.clear();

    int cnt = 0;
    for (int i = 1; i <= sz; i++)
    {
        if (getf(i) == i)
        {
            circle c;
            c.id = ++cnt;
            c.r = sqrt(temp[i].r);
            c.x = temp[i].x / cntf[i];
            c.y = temp[i].y / cntf[i];
            c.s = temp[i].s;
            S.push_back(c);
        }
    }
}

int main()
{
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
    {
        circle c;
        c.id = i;
        scanf("%lf%lf%lf%lf", &c.x, &c.y, &c.r, &c.s);
        S.push_back(c);
    }
    while (S.size() > 1)
    {
        double t = getT();
        // for (circle &c : S)
        // {
        //     printf("%.8f %.8f %.8f\n", c.x, c.y, c.r);
        // }
        while (t < eps)
        {
            merge();
            t = getT();
        }
        if (S.size() > 1)
            addT(t);
    }

    for (circle &c : S)
    {
        printf("%.8f %.8f\n%.8f\n", c.x, c.y, c.r);
    }
    return 0;
}