#include<bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)

using namespace std;
using ll=long long;
using ld=long double;
using d_i=pair<ld,int>;

template <typename T>
class Bit{
public:
  Bit(int size):bit(vector<T>(size+1)),size(size){}
  T sum(int i){
    int s=0;
    while(i>0){
      s+=bit[i];
      i-=i&-i;
    }
    return s;
  }
  void add(int i,T x){
    while(i<=size){
      bit[i]+=x;
      i+=i&-i;
    }
  }
private:
  Bit();
  vector<T> bit;
  int size;
};

ll n;
const int MAX_N=40010;
ld a[MAX_N],b[MAX_N],c[MAX_N];
d_i di[MAX_N];
ld _a[MAX_N],_b[MAX_N],_c[MAX_N];
ld solve(){
  REP(i,n) di[i]=d_i(a[i]/b[i],i);
  sort(di,di+n);
  REP(i,n){
    int j=di[i].second;
    _a[i]=a[j];
    _b[i]=b[j];
    _c[i]=c[j];
  }
  ld lo=-1e9,hi=1e9;
  REP(z,100){
    ld x=(lo+hi)/2;
    d_i yi[n];
    REP(i,n){
      yi[i]=d_i((_c[i]-_a[i]*x)/_b[i],i+1);
    }
    sort(yi,yi+n);
    Bit<int> bit(n);
    ll sum=0;
    REP(j,n){
      int i=yi[j].second;
      sum+=j-bit.sum(i);
      bit.add(i,1);
    }
    if(sum*2>=n*(n-1)/2) hi=x;
    else lo=x;
  }
  return lo;
}

int main(){ _;
  cin>>n;
  REP(i,n)cin>>a[i]>>b[i]>>c[i];
  ld x=solve();
  swap(a,b);
  ld y=solve();
  printf("%.15Lf %.15Lf\n",x,y);
}
