//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 100010001;
const ll LINF = (ll)INF*INF*10;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

int main() {
    cout << fixed << setprecision(13);
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    ll crt = (ll(n)*(n-1)/2)>>1;
    vector<double> a(n), b(n), c(n);
    rep(i, n) {
        cin >> a[i] >> b[i] >> c[i];
    }
    vector<double> ta(n);
    rep(i, n) {
        ta[i] = -a[i]/b[i];
    }
    vector<double> co = ta;
    sort(all(co));
    vector<double> a_ = a, b_ = b, c_ = c;
    rep(i, n) {
        int num = lower_bound(all(co), ta[i]) - co.begin();
        a[num] = a_[i], b[num] = b_[i], c[num] = c_[i];
    }



    int bit[40001];
    auto add = [&](int i, int x) {
        while(i <= n) {
            bit[i] += x;
            i += i&-i;
        }
    };
    auto sum = [&](int i) {
        int res = 0;
        while(i) {
            res += bit[i];
            i &= i-1;
        }
        return res;
    };

    pair<double, double> ans;
    double aa = -1e9, bb, cc = 1e9;
    rep(i, 100) {
        bb = (aa+cc)/2;
        vector<double> y(n);
        rep(j, n) {
            y[j] = (c[j]-a[j]*bb)/b[j];
        }
        vector<double> yy = y;
        sort(all(yy));
        memset(bit, 0, sizeof(bit));
        ll cnt = 0;
        rep(i, n) {
            cnt += i-sum(lower_bound(all(yy), y[i]) - yy.begin() + 1);
            add(lower_bound(all(yy), y[i]) - yy.begin() + 1, 1);
        }
        if(cnt <= crt) {
            cc = bb;
        } else {
            aa = bb;
        }
    }
    ans.first = cc;

    rep(i, n) {
        ta[i] = 1/co[i];
    }
    co = ta;
    sort(all(co));
    a_ = a, b_ = b, c_ = c;
    rep(i, n) {
        int num = lower_bound(all(co), ta[i]) - co.begin();
        a[num] = a_[i], b[num] = b_[i], c[num] = c_[i];
    }

    aa = -1e9;
    cc = 1e9;
    rep(i, 100) {
        bb = (aa+cc)/2;
        vector<double> x(n);
        rep(j, n) {
            x[j] = (c[j]-b[j]*bb)/a[j];
        }
        vector<double> xx = x;
        sort(all(xx));
        memset(bit, 0, sizeof(bit));
        ll cnt = 0;
        rep(i, n) {
            cnt += i-sum(lower_bound(all(xx), x[i]) - xx.begin() + 1);
            add(lower_bound(all(xx), x[i]) - xx.begin() + 1, 1);
        }
        if(cnt <= crt) {
            cc = bb;
        } else {
            aa = bb;
        }
    }
    ans.second = cc;

    cout << ans << endl;
}

Measured memory_bytes: 6804