#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)
#define ALL(container) (container).begin(), (container).end()
#define RALL(container) (container).rbegin(), (container).rend()
#define SZ(container) ((int)container.size())
#define mp(a,b) make_pair(a, b)
#define pb push_back
#define eb emplace_back
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define __builtin_popcount __builtin_popcountll

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
    os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
template<class T> ostream& operator<<(ostream &os, const set<T> &t) {
    os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}

const int INF = 1<<28;
const double EPS = 1e-14;
const int MOD = 1000000007;


int T, n, m;
typedef tuple<ll, ll, ll> L;

int mergecount(vector<double> &a) {
    int count = 0;
    int n = a.size();
    if (n > 1) {
        vector<double> b(a.begin(), a.begin() + n/2);
        vector<double> c(a.begin() + n/2, a.end());
        count += mergecount(b);
        count += mergecount(c);
        for (int i = 0, j = 0, k = 0; i < n; ++i)
            if (k == c.size())       a[i] = b[j++];
            else if (j == b.size())  a[i] = c[k++];
            else if (b[j] <= c[k] - EPS)   a[i] = b[j++];
            else                   { a[i] = c[k++]; count += n/2 - j; }
    }
    return count;
}

bool check(const vector<L> &e, double x) {
    vector<double> v;
    REP(i, e.size()) {
        int a, b, c; tie(a, b, c) = e[i];
        double y = (-a * x + c) / b;
        v.emplace_back(y);
    }
    ll pn = (ll)e.size() * ((ll)e.size()-1) / 2;
    ll res = mergecount(v);
    return pn - res <= (pn - 1) / 2;
}

double solve(vector<L> e) {
    sort(e.begin(), e.end(), [](const L &a, const L &b) {
        return get<0>(a) * get<1>(b) > get<0>(b) * get<1>(a);
    });

    double l = - 1e10, r = 1e10;
    REP(_, 300) {
        double x = (l+r) / 2;
        if(!check(e, x)) r = x;
        else l = x;
    }
    return l;
}

int main(int argc, char *argv[]){
    ios::sync_with_stdio(false);
    while(cin >> n){
        vector<L> e1, e2;
        REP(i, n){
            int a, b, c;
            cin >> a >> b >> c;
            if (b < 0) {
                a *= -1;
                b *= -1;
                c *= -1;
            }
            e1.emplace_back(a, b, c);
            if (a < 0) {
                a *= -1;
                b *= -1;
                c *= -1;
            }
            e2.emplace_back(b, a, c);
        }
        printf("%.20f %.20f\n", solve(e1), solve(e2));
    }
    return 0;
}


Measured memory_bytes: 6956