#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
#define MAXN 111
using namespace std;
int n;
struct Circ{
    double x,y,r,s;
};
double dis(Circ A,Circ B)
{
    return sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y)); 
}
double touch_t(Circ A,Circ B)
{
    return (dis(A,B)-A.r-B.r)/(A.s+B.s);
}
vector <Circ> vec;
int merge(int l)
{
    Circ c;c.x=0;c.y=0;c.r=0;c.s=0;
    Circ me = vec[l];
    int cnt=0;
    for(int i=0 ;i<vec.size();)
    {
        if(dis(me,vec[i])-me.r-vec[i].r <= 0)
        {
            cnt++;
            c.r+=(vec[i].r)*(vec[i].r);
            c.s=max(c.s,vec[i].s);
            c.x+=vec[i].x;
            c.y+=vec[i].y;
            swap(vec[i],vec[(int)vec.size()-1]);
            vec.pop_back();
        }
        else
            ++i;
    }
    c.r=sqrt(c.r);c.x/=cnt;c.y/=cnt;
    vec.push_back(c);
    return cnt;
}
int main()
{
    cin>>n;
    //srand(time(0));
    //n=100;
    for(int i=1;i<=n;i++)
    {
        Circ c;
        cin>>c.x>>c.y>>c.r>>c.s;
        //c.x=rand()%2000000001+1000000000;
        //c.y=rand()%2000000001+1000000000;
        //c.r=rand()%1000000+1;
        //c.s=rand()%1000000+1;
        vec.push_back(c);
    }

    while(vec.size()>1)
    {
        int l=-1,r=-1;
        for(int i=0;i<vec.size();i++)
            for(int j=i+1;j<vec.size();j++)
                if(l==-1 || touch_t(vec[l],vec[r])>touch_t(vec[i],vec[j]))
                {
                    l=i;r=j;
                }
        double t = touch_t(vec[l],vec[r]);
        for(int i=0;i<vec.size();i++)
        {
            vec[i].r += t*vec[i].s;
        }
        while(merge(l)>1){
            l=vec.size()-1;
        }
    }  

    printf("%.10lf %.10lf\n%.10lf\n",vec[0].x,vec[0].y,vec[0].r);


    return 0;
}