#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
#include<time.h>
#include<cassert>

using namespace std;
typedef long long ll;
typedef long double ld;
#define all(a) (a).begin(),(a).end()
#define EPS (1e-13)
#define bit(n,k) ((n>>k)&1)
const ll Mod = 1e9 + 7;
const ll mod = 998244353;
struct H {
	ll x, y;
	bool operator<(const H& b) const {
		if (x != b.x) return x < b.x;
		return y < b.y;
	}
	bool operator>(const H& b) const {
		if (x != b.x) return x > b.x;
		return y > b.y;
	}
	bool operator==(const H& b) const { return x == b.x && y == b.y; }
	bool operator!=(const H& b) const { return (*this) != b; }
};
struct P {
	ll pos, cost;
	bool operator<(const P& b) const { return cost < b.cost; }
	bool operator>(const P& b) const { return cost > b.cost; }
};
struct B {
	ll to, cost;
};
struct E {
	ll from, to, cost;
	bool operator<(const E& b) const { return cost < b.cost; }
	bool operator>(const E& b) const { return cost > b.cost; }
};
template<typename T, typename U>
void chmin(T& a, U b) {
	if (a > b) a = b;
}
template<typename T, typename U>
void chmax(T& a, U b) {
	if (a < b) a = b;
}
template<typename T>
T max_0(T a) {
	if (a < 0) return 0;
	return a;
}
template<typename T>
T min_0(T a) {
	if (a > 0) return 0;
	return a;
}
ll read() {
	ll u;
	ll k = scanf("%lld", &u);
	return u;
}
ll gcd(ll i, ll j) {
	if (i > j) swap(i, j);
	if (i == 0) return j;
	return gcd(j % i, i);
}
ll mod_pow(ll x, ll n, ll p) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * x % p;
		x = x * x % p;
		n >>= 1;
	}
	return res;
}//x^n%p
ll bitcount(ll x) {
	int sum = 0;
	for (int i = 0; i < 20; i++)
		if ((1ll << i) & x) sum++;
	return sum;
}
/*ll fact_[200000];
ll comb(ll x, ll y, ll mod = Mod) {
	if (!fact_[0]) {
		fact_[0] = 1;
		for (int i = 1; i < 200000; i++) {
			fact_[i] = fact_[i - 1] * i % mod;
		}
	}
	if (x < y) return 0;
	return mod_pow(fact_[x], mod, mod) *
		mod_pow(fact_[x - y], mod - 2, mod) % mod *
		mod_pow(fact_[y], mod - 2, mod) % mod;
}//xCy*/
const ll Inf = 3023372036854775807;
const int inf = 1500000000;
#define int long long
//----------------------------------------------------
int n;
ld k;
struct A {
	ld a, b, c, d;
	//ax+by=c
	//y=-a/bx+c/b
	bool operator<(A e) {
		ld u = -a * k / b + c / b;
		ld v = -e.a * k / e.b + e.c / e.b;
		if (u != v) return  u < v;
		return d < e.d;
	}
};
int dat[200000];
void add(int x, int y) {
	while (x <= n) {
		dat[x] += y;
		x += x & -x;
	}
}
int query(int x) {
	int sum = 0;
	while (x > 0) {
		sum += dat[x];
		x -= x & -x;
	}
	return sum;
}
A a[200000];
ld solve() {
	ld ng = -200000000, ok = 200000000, t;
	//自分より左の交点の個数がg以上である最小の点
	int g = ceil(n * (n - 1) / 2 / 2.);
	while (abs(ok - ng) > 1e-11) {
		for (int i = 0; i <= n; i++) 
			dat[i] = 0;
		t = (ok + ng) / 2;
		k = t;
		sort(a, a + n);
		vector<ld>u;
		for (int i = 0; i < n; i++) {
			u.push_back(a[i].d);
		}
		sort(all(u));
		u.erase(unique(all(u)), u.end());
		//上から順番に、自分よりも傾きの低いものを数えていく
		int sum = 0;
		for (int i = 0; i < n; i++) {
			int r = lower_bound(all(u), a[i].d) - u.begin();
			sum += query(r + 1);
			add(r + 1, 1);
		}
		if (sum >= g) ok = t;
		else ng = t;
	}
	return ok;
}
signed main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i].a >> a[i].b >> a[i].c;
		a[i].d = -a[i].a / a[i].b;
	}
	ld x = solve();
	for (int i = 0; i < n; i++) {
		swap(a[i].a, a[i].b);
		a[i].d = -a[i].a / a[i].b;
	}
	ld y = solve();
	printf("%.15LF %.15LF\n", x, y);
}

Measured memory_bytes: 6408