#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
typedef long long LL;
typedef pair<int, int> PII;

int n;
int a[100000], b[100000], c[100000], ord[100000], tmp[100000];

void re(int *a) {
    forn(i, n) tmp[i] = a[ord[i]];
    forn(i, n) a[i] = tmp[i];
}

inline bool cmpX(const int &lhs, const int &rhs) {
    return -a[lhs] * b[rhs] < -a[rhs] * b[lhs];
}

inline bool cmpY(const int &lhs, const int &rhs) {
    return -b[lhs] * a[rhs] < -b[rhs] * a[lhs];
}

pair<double, int> p[100000];

int fen[100000];

void fenInc(int pos) {
    for (; pos < n; pos |= pos + 1) {
        ++fen[pos];
    }
}

int fenGet(int pos) {
    int res = 0;
    for (; pos >= 0; pos = (pos & (pos + 1)) - 1) {
        res += fen[pos];
    }
    return res;
}

int main() {
    scanf("%d", &n);
    forn(i, n) {
        scanf("%d%d%d", a + i, b + i, c + i);
        c[i] *= -1;
        if (b[i] < 0) {
            a[i] *= -1;
            b[i] *= -1;
            c[i] *= -1;
        }
    }

    forn(i, n) ord[i] = i;
    sort(ord, ord + n, cmpX);
    re(a);
    re(b);
    re(c);
    double lo = -1e13, hi = 1e13, mid;
    forn(_, 100) {
        mid = (lo + hi) / 2;
        forn(i, n) p[i] = mp((-c[i] - a[i] * mid) / b[i], i);
        sort(p, p + n);
        LL cnt = 0;
        memset(fen, 0, sizeof fen);
        forn(i, n) {
            cnt += fenGet(p[i].second);
            fenInc(p[i].second);
        }
        if (cnt < (n * (n - 1) / 2 + 1) / 2) {
            lo = mid;
        } else {
            hi = mid;
        }
    }
    printf("%.15f ", lo);

    forn(i, n) {
        if (a[i] < 0) {
            a[i] *= -1;
            b[i] *= -1;
            c[i] *= -1;
        }
    }
    forn(i, n) ord[i] = i;
    sort(ord, ord + n, cmpY);
    re(a);
    re(b);
    re(c);
    lo = -1e13, hi = 1e13;
    forn(_, 100) {
        mid = (lo + hi) / 2;
        forn(i, n) p[i] = mp((-c[i] - b[i] * mid) / a[i], i);
        sort(p, p + n);
        LL cnt = 0;
        memset(fen, 0, sizeof fen);
        forn(i, n) {
            cnt += fenGet(p[i].second);
            fenInc(p[i].second);
        }
        if (cnt < (n * (n - 1) / 2 + 1) / 2) {
            lo = mid;
        } else {
            hi = mid;
        }
    }
    printf("%.15f\n", lo);
    return 0;
}
