#include<iostream>
#include<cmath>
#include<string.h>
#include<stdio.h>
#include<algorithm>
using namespace std;

int n;
double a[500011],b[500011],c[500011];

double ans;
double eps=1e-12;

bool eq(double xx,double yy)
{
    double p,q;
    p=fabs(xx-yy);
    q=fabs(xx)+fabs(yy);
    if((p<q*eps) || p<eps)
    {
        return 1;
    }
    return 0;
}

struct node
{
    double y;
    double d;
    int id;
};

node p[500011];

bool cmp(node xx,node yy)
{
    if(fabs(xx.y-yy.y)>1e-12)
    {
        return xx.y<yy.y;
    }
    return xx.d<yy.d;
}
bool cmp2(node xx,node yy)
{
    return xx.d<yy.d;
}





int r[500011];
int tree[500011];

int lb(int x)
{
    return x&(-x);
}

void ins(int k)
{
    int i;
    for(i=k;i<=n;i+=lb(i))
    {
        tree[i]++;
    }
}
int calc(int k)
{
    int i,ans=0;
    for(i=k;i>0;i-=lb(i))
    {
        ans+=tree[i];
    }
    return ans;
}


long long check(double x)
{
    //cout<<x<<"  kkk"<<endl;
    int i;
    for(i=1;i<=n;i++)
    {
         //cout<<a[i]<<' '<<b[i]<<' '<<c[i]<<"  III"<<endl;
         p[i].y=(c[i]-a[i]*x)/b[i];
         p[i].d=-a[i]/b[i];
         p[i].id=i;
         
         
         //cout<<p[i].y<<' '<<p[i].d<<' '<<p[i].id<<endl;
    }
    //cout<<"!!!!"<<endl;
    //system("pause");
    sort(p+1,p+n+1,cmp);
    
    for(i=1;i<=n;i++)
    {
        r[p[i].id]=i;
    }
    sort(p+1,p+n+1,cmp2);
    memset(tree,0,sizeof(tree));
    
    
    long long ans=0;
    for(i=1;i<=n;i++)
    {
        ans+=calc(r[p[i].id]);
        ins(r[p[i].id]);
    }
    return ans;
}


void gao()
{
    double from=-1e14,to=1e14;
    double mid;
    long long k=(long long)n*(n-1)/2;
    k=(k+1)/2;
    
    while(!eq(from,to))
    {
        //cout<<from<<' '<<to<<endl;
        mid=(from+to)/2.0;
        if(check(mid)>=k)
        {
            to=mid;
        }
        else
        {
            from=mid;
        }
    }
    
    ans=(from+to)/2.0;
    return ;
}


int main()
{
    int i,j;
    int xx,yy,zz;
    
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d %d %d",&xx,&yy,&zz);
        a[i]=xx;b[i]=yy;c[i]=zz;
        //cout<<a[i]<<' '<<b[i]<<' '<<c[i]<<"^^^"<<endl;
    }
    
    double x,y;
    
    gao();
    x=ans;
    for(i=1;i<=n;i++)
    {
        swap(a[i],b[i]);
    }
    gao();
    y=ans;
    
    
    cout.precision(15);
    cout.setf(ios::fixed);
    cout<<x<<' '<<y<<endl;
    
    
    
    return 0;
}
