#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "cassert"
#include "functional"
#include "ctime"

using namespace std;

constexpr long long int MOD = 1000000007;
//constexpr int MOD = 1000000007;
//constexpr int MOD = 998244353;
//constexpr long long int MOD = 998244353;
constexpr double EPS = 1e-8;

//int N, M, K, H, W, L, R;
long long int N, M, K, H, W, L, R;

class Add_Segment_Tree {
	vector<long long int>v;
	vector<int>l;
	vector<int>r;
	long long int ret;
	int num;
	long long int Update(int place) {
		if (place >= v.size() / 2) {
			return v[place];
		}
		v[place] = Update(place * 2) + Update(place * 2 + 1);
		return v[place];
	}
	void Sum(int a, int b, int place) {
		if (l[place] >= a && r[place] <= b) {
			ret += v[place];
			return;
		}
		if (l[place] > b || r[place] < a) return;
		Sum(a, b, place * 2);
		Sum(a, b, place * 2 + 1);
		return;
	}
public:
	void Left(int place) {
		if (place >= v.size() / 2) {
			l[place] = place - v.size() / 2;
			return;
		}
		Left(place * 2);
		Left(place * 2 + 1);
		l[place] = l[place * 2];
		return;
	}
	void Right(int place) {
		if (place >= v.size() / 2) {
			r[place] = place - v.size() / 2;
			return;
		}
		Right(place * 2);
		Right(place * 2 + 1);
		r[place] = r[place * 2 + 1];
		return;
	}
	Add_Segment_Tree(int n) {
		n++;
		num = 1;
		while (num < n * 2)num *= 2;
		l.resize(num);
		r.resize(num);
		v.resize(num, 0);
		Left(1);
		Right(1);
	}
	void Add(int place, long long int num, bool update) {
		place += v.size() / 2;
		v[place] += num;
		if (!update)return;
		place /= 2;
		while (place) {
			v[place] = v[place * 2] + v[place * 2 + 1];
			place /= 2;
		}
	}
	void TopDown() {
		Update(1);
	}
	long long int Sum(int a, int b) {
		ret = 0;
		Sum(a, b, 1);
		return ret;
	}
};

struct Line {
	long double a, b, c;
	int index;
	Line(const long double aa, const long double bb, const long double cc,const int ii) {
		a = aa, b = bb, c = cc, index = ii;
	}
	bool operator<(const Line&l)const {
		return -a / b < -l.a / l.b;
	}
};

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> N;
	vector<Line>line;
	for (int i = 0; i < N; i++) {
		long double a, b, c;
		cin >> a >> b >> c;
		line.push_back(Line(a, b, c, i));
	}
	long long int border = N * (N - 1) / 2;
	border++;
	border /= 2;
	sort(line.begin(), line.end());
	reverse(line.begin(), line.end());
	long double x=0, y=0;
	long double l = -1e9;
	long double r = 1e9;
	vector<int>bef(N);
	map<int, int>conv;
	for (int i = 0; i < N; i++)bef[i] = line[i].index;
	for (int i = 0; i < N; i++) {
		conv[bef[i]] = i;
	}
	for (int i = 0; i < 100; i++) {
		long double mid = (r + l) / 2;
		vector<pair<long double, int>>aft(N);
		for (int j = 0; j < N; j++) {
			aft[j] = { (-line[j].a*mid + line[j].c) / line[j].b,line[j].index };
		}
		sort(aft.begin(), aft.end());
		for (int j = 0; j < N; j++)aft[j].second = conv[aft[j].second];
		Add_Segment_Tree asg(N);
		long long int sum = 0;
		for (int j = 0; j < N; j++) {
			sum += asg.Sum(aft[j].second, N);
			asg.Add(aft[j].second, 1, true);
		}
		if (sum < border)l = mid;
		else r = mid;
	}
	x = l;
	
	for (auto&i : line)swap(i.a, i.b);
	sort(line.begin(), line.end());
	reverse(line.begin(), line.end());
	l = -1e9;
	r = 1e9;
	for (int i = 0; i < N; i++)bef[i] = line[i].index;
	for (int i = 0; i < N; i++) {
		conv[bef[i]] = i;
	}
	for (int i = 0; i < 100; i++) {
		long double mid = (r + l) / 2;
		vector<pair<long double, int>>aft(N);
		for (int j = 0; j < N; j++) {
			aft[j] = { (-line[j].a*mid + line[j].c) / line[j].b,line[j].index };
		}
		sort(aft.begin(), aft.end());
		for (int j = 0; j < N; j++)aft[j].second = conv[aft[j].second];
		Add_Segment_Tree asg(N);
		long long int sum = 0;
		for (int j = 0; j < N; j++) {
			sum += asg.Sum(aft[j].second, N);
			asg.Add(aft[j].second, 1, true);
		}
		if (sum < border)l = mid;
		else r = mid;
	}
	y = l;
	cout << setprecision(20) << x << " " << y << endl;
}

Measured memory_bytes: 11116