#include <iostream>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <fstream>
#include <bitset>
#include <queue>
#include <stack>
#include <deque>
#include <complex>
#include <iomanip>
#include <stdio.h>
#include <string.h>
#include <random>
#include <functional>

using std::cin;
using std::cout;
using std::cerr;
using std::endl;

using std::map;
using std::set;
using std::bitset;
using std::vector;
using std::string;
using std::multimap;
using std::multiset;
using std::deque;
using std::queue;
using std::stack;
using std::pair;
using std::iterator;

using std::sort;
using std::stable_sort;
using std::reverse;
using std::max_element;
using std::min_element;
using std::unique;
using std::ios_base;
using std::swap;
using std::fill;

using std::setprecision;
using std::fixed;

long long min(long long a, long long b) {return a < b ? a : b;}
long long min(int a, long long b) {return a < b ? a : b;}
long long min(long long a, int b) {return a < b ? a : b;}
long long min(int a, int b) {return a < b ? a : b;}

long long max(long long a, long long b) {return a > b ? a : b;}
long long max(int a, long long b) {return a > b ? a : b;}
long long max(long long a, int b) {return a > b ? a : b;}
long long max(int a, int b) {return a > b ? a : b;}

#define int long long

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef string S;

#define F(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define fi first
#define se second
#define re return
#define all(x) (x).begin(), (x).end()

const long long INF = 1e18;
const int N = 210110;
const int MOD = 998244353;
const double eps = 1e-8;

long long inq(ll a, ll b)
{
    if(b == 0) return 1;
    ll l = inq(a, b / 2);
    if (b % 2) return l * l % MOD * a % MOD;
    return l * l % MOD;
}

int n;
double a[N], b[N], c[N];

int tree[N];

int get(int r)
{
    int res = 0;
    for (; r >= 0; r = (r & (r+1)) - 1)
		res += tree[r];
	return res;
}

void add(int p)
{
    for (; p < n; p = (p | (p + 1)))
		tree[p]++;
}

int calc(vector<int> perm)
{
    vector<int> pos(perm.size());
    for (int i = 0; i < perm.size(); i++)
    {
        pos[perm[i]] = i;
    }
    fill(tree, tree + perm.size(), 0);
    int res = 0;
    for (int i = pos.size() - 1; i >= 0; i--)
    {
        res += get(pos[i] - 1);
        add(pos[i]);
    }
    return res;
}

int checkx(double X)
{
    vector<pair<double, int> > s;
    vector<pair<double, int> > f;
    for (int i = 0; i < n; i++)
    {
        double xs = -1e9;
        double xf = X;
        double ys = (c[i] - a[i] * xs) / b[i];
        double yf = (c[i] - a[i] * xf) / b[i];
        s.push_back({ys, i});
        f.push_back({yf, i});
    }
    vector<int> pos(n);
    sort(all(s));
    sort(all(f));
    for (int i = 0; i < n; i++) pos[s[i].second] = i;
    vector<int> perm;
    for (int i = 0; i < n; i++)
    {
        int ps = pos[f[i].second];
        perm.push_back(ps);
    }
    return calc(perm);
}

int checky(double X)
{
    vector<pair<double, int> > s;
    vector<pair<double, int> > f;
    for (int i = 0; i < n; i++)
    {
        double xs = -1e9;
        double xf = X;
        double ys = (c[i] - b[i] * xs) / a[i];
        double yf = (c[i] - b[i] * xf) / a[i];
        s.push_back({ys, i});
        f.push_back({yf, i});
    }
    vector<int> pos(n);
    sort(all(s));
    sort(all(f));
    for (int i = 0; i < n; i++) pos[s[i].second] = i;
    vector<int> perm;
    for (int i = 0; i < n; i++)
    {
        int ps = pos[f[i].second];
        perm.push_back(ps);
    }
    return calc(perm);
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> a[i] >> b[i] >> c[i];
    }
    int k = n * (n - 1) / 2;
    double lx = -1e9, rx = 1e9;
    for (int i = 0; i < 64; i++)
    {
        double mx = (lx + rx) / 2;
        if (checkx(mx) >= (k + 1) / 2)
        {
            rx = mx;
        }
        else
        {
            lx = mx;
        }
    }
    printf("%.10f ", rx);
    double ly = -1e9, ry = 1e9;
    for (int i = 0; i < 64; i++)
    {
        double my = (ly + ry) / 2;
        if (checky(my) >= (k + 1) / 2)
        {
            ry = my;
        }
        else
        {
            ly = my;
        }
    }
    printf("%.10f\n", ry);
}


Measured memory_bytes: 7992