#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a,b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout<<" "<<kbrni;cout<<endl
#define smap(m) cout<<#m<<":";each(kbrni,m)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl

using namespace std;

typedef pair<double,double>P;

const int MAX_N = 100005;

template<class V> class BIT {
private:
	int n;
	vector<V> bit;

public:
	void add(int i,V x)
	{
		while(i < n){
			bit[i] += x;
			i += i & -i;
		}
	}
	V sum(int i)
	{
		V s = 0;
		while(i>0){
			s += bit[i];
			i -= i & -i;
		}
		return s;
	}
	//初期値がすべて0の場合
	BIT(int sz){
		n = sz + 1;
		bit.resize(n,0);
	}
	BIT(vector<V> v) {
		int sz = (int)v.size();
		n = sz + 1;
		bit.resize(n);
		rep(i,sz){
			 add(i+1,v[i]);
		}
	}
	void print()
	{
		cout << "0 ";
		for(int i=1;i<n;i++){
			cout << sum(i) - sum(i-1) << " ";
		}
		cout << endl;
	}
	void print_sum()
	{
		rep(i,n){
			cout << sum(i) << " ";
		}
		cout << endl;
	}
};

int n;

bool ok(vector<double>& s,vector<double>& t,double cri)
{
    vector<P> vec(n);
    rep(i,n){
        vec[i] = P(cri*s[i]+t[i],i);
    }
    sort(all(vec));
    BIT<int> bt(n+5);
    int num = 0;
    rep(i,n){
        int hoge = round(vec[i].se);
        num += bt.sum(hoge+1);
        bt.add(hoge+1,1);
    }
    if(n*(n-1)/2 % 2 == 0){
        return num < n*(n-1)/4;
    }else{
        return num <= n*(n-1)/4;
    }
}

double solve(vector<P>& vec)
{
    vector<double> tilt(n),tang(n);
    rep(i,n){
        tilt[i] = vec[i].fi,tang[i] = vec[i].se;
    }
    double l = -INF,h = INF;
    double mid;
    rep(i,100){
        mid = (l+h)/2;
        if(ok(tilt,tang,mid)){
            l = mid;
        }else{
            h = mid;
        }
    }
    return mid;
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n;
    vector<P> v1(n),v2(n);
    rep(i,n){
        int a,b,c;
        cin >> a >> b >> c;
        v1[i] = P((double)a/-b,(double)c/b);
        v2[i] = P((double)b/-a,(double)c/a);
    }
    sort(all(v1)),sort(all(v2));
    printf("%.12lf %.12lf\n",solve(v1),solve(v2));
    return 0;
}
