#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using vint = vector<int>;
using vvint = vector<vint>;
using vvvint = vector<vvint>;
using vdouble = vector<double>;
using vvdouble = vector<vdouble>;
using vvvdouble = vector<vvdouble>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using uint = unsigned int;
using ull = unsigned long long;

template<typename T> using uset = unordered_set<T>;
template<typename T1, typename T2> using umap = unordered_map<T1, T2>;

constexpr int INF = (1 << 30) - 1;
constexpr ll LLINF = 1LL << 60;
constexpr int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr char el = '\n';
constexpr int mod = 1000000007;
constexpr int mod2 = 998244353;
template<typename T> T gcd(T a, T b) { return (b ? gcd(b, a % b) : a); }
template<typename T> T lcm(T a, T b) { return (a / gcd(a, b) * b); }
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) { return (a > b && (a = b, true)); }
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) { return (a < b && (a = b, true)); }
template<typename T>
bool isin(T y, T x, T h, T w) { return (0 <= y && 0 <= x && y < h && x < w); }
template<typename T>
bool isin1(T y, T x, T h, T w) { return (0 < y && 0 < x && y <= h && x <= w); }

template<typename T>
ostream& operator <<(ostream &os, vector<T> &v) {
	os << v[0];
	for (int i = 1; i < v.size(); i++) os << " " << v[i];
	return (os);
}

template<typename T>
istream& operator >>(istream &is, vector<T> &v) {
	for (auto &u : v) is >> u;
	return (is);
}

template<typename T1, typename T2>
istream& operator >>(istream &is, pair<T1, T2> &p) {
	return (is >> p.first >> p.second);
}


template<typename T> 
struct BIT {
	vector<T> dat;

	BIT (int n) { dat.assign(n+1, 0); }

	void add(int k, T x) {
		for (++k; k < dat.size(); k += k & -k) dat[k] += x;
	}

	T query(int k) {
		T sum = 0;
		for (++k; k > 0; k -= k & -k) sum += dat[k];
		return (sum);
	}

	//[l, r]
	T fold(int l, int r) {
		return (query(r) - (l > 0 ? query(l-1) : 0));
	}

	int lower_bound(T x) {
		int l, r;
		l = -1, r = dat.size();
		while (l + 1 < r) {
			int m = (l + r) / 2;
			if (query(m) >= x) r = m;
			else l = m;
		}
		return (r);
	}
};

//0-indexed
long long invNum(vector<int> &perm) {
	long long ans = 0;
	int n = perm.size();
	BIT<int> tree(n);
	for (int j = 0; j < n; j++) {
		ans += j-tree.query(perm[j]);
		tree.add(perm[j], 1);
	}
	return (ans);
}

void Main() {
	int N; cin >> N;
	ll size = ((ll)N-1)*(N)/2;
	vector<tuple<int, int, int>> dats(N);
	for (int i = 0; i < N; i++) {
		int a, b, c; cin >> a >> b >> c;
		dats[i] = tie(a, b, c);
	}

	sort(begin(dats), end(dats), [](tuple<int,int,int> d1, tuple<int,int,int> d2) {
		int a1, b1, c1;
		int a2, b2, c2;
		tie(a1, b1, c1) = d1;
		tie(a2, b2, c2) = d2;
		return ((double)a1/b1 < (double)a2/b2);
	});

	for (int i = 0; i < N; i++) {
		int a, b, c;
		tie(a, b, c) = dats[i];
		//cout << a << " " << b << " " << c << endl;
	}
		
	double ansx, ansy;

	//x
	double ng = -1e10, ok = 1e10;
	for (int _ = 0; _ < 100; _++) {
		double tx = (ng+ok)/2;
		vint perm(N);
		vector<pair<double, int>> d(N);
		for (int i = 0; i < N; i++) {
			int a, b, c;
			tie(a, b, c) = dats[i];
			d[i] = make_pair(-(double)a/b*tx + (double)c/b, i);
		}
		sort(begin(d), end(d));
		for (int i = 0; i < N; i++) {
			perm[i] = d[i].second;
		}
		//cout << perm << endl;
		ll inv = invNum(perm);
		//cout << tx << " " << inv << endl;
		if (inv >= (size+1)/2) ok = tx;
		else ng = tx;
	}
	ansx = ok;

	sort(begin(dats), end(dats), [](tuple<int,int,int> d1, tuple<int,int,int> d2) {
		int a1, b1, c1;
		int a2, b2, c2;
		tie(a1, b1, c1) = d1;
		tie(a2, b2, c2) = d2;
		return ((double)b1/a1 < (double)b2/a2);
	});
	
	//y
	ng = -1e10, ok = 1e10;
	for (int _ = 0; _ < 100; _++) {
		double ty = (ng+ok)/2;
		vint perm(N);
		vector<pair<double, int>> d(N);
		for (int i = 0; i < N; i++) {
			int a, b, c;
			tie(a, b, c) = dats[i];
			d[i] = make_pair(-(double)b/a*ty + (double)c/a, i);
		}
		sort(begin(d), end(d));
		for (int i = 0; i < N; i++) {
			perm[i] = d[i].second;
		}
		ll inv = invNum(perm);
		if (inv >= (size+1)/2) ok = ty;
		else ng = ty;
	}

	ansy = ok;	
	cout << ansx << " " << ansy << endl;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout << fixed << setprecision(20);
	Main();
	return (0);
}


Measured memory_bytes: 1740