#ifndef __UNION_FIND_H__0004__
#define __UNION_FIND_H__0004__

class UnionFindTree {
	int whole_size_m;
	int* parent_p_m;	// 根である場合は自分自身の添え字を入れる
	int* rank_p_m;
	int* size_p_m;		// 集合のサイズ(根に大きさを書く)

	bool Is_valid_index(int index);
	int Root_of_rec(int index);
public:
	UnionFindTree(int whole_size);
	~UnionFindTree();

	int Root_of(int index);
	void Unite(int index_l, int index_r);
	bool Are_together(int index_l, int index_r);
	int Size_of_set(int index);
};

#include <cmath>
#include <cassert>
#include <functional>
#include <algorithm>

/* 
 * std::min を使う際、
 *		SegmentTree<int> seg(N, INF, (const int&(*)(const int&, const int&))std::min);
 * と書かなければならないので、後述の Min を使って
 *		SegmentTree<int> seg(N, INF, Min<int>());
 * とする。
 */
template <typename T>
class SegmentTree {
	using FuncType = std::function<T(const T&, const T&)>;

private:
	T* val_p_m;
	const T init_val_m;
	const int size_m;
	const int rank_m;

	const FuncType func_m;

	T Query_rec(int range_left, int range_right, int node_index, int node_range_left, int node_range_right);
	bool Is_valid_index(int index);
public:
	SegmentTree(int size, const T& init_val, const FuncType& func);
	~SegmentTree();

	void Update(int pos, const T& val);
	T Query(int range_left, int range_right);
};

template<typename T>
T SegmentTree<T>::Query_rec(int range_left, int range_right, int node_index, int node_range_left, int node_range_right) {
	if (node_range_right <= range_left || range_right <= node_range_left) return init_val_m;
	if (range_left <= node_range_left && node_range_right <= range_right) return val_p_m[node_index];

	int node_range_mid = (node_range_left + node_range_right) / 2;
	const T val_left = Query_rec(range_left, range_right, node_index * 2, node_range_left, node_range_mid);
	const T val_right = Query_rec(range_left, range_right, node_index * 2 + 1, node_range_mid, node_range_right);
	return func_m(val_left, val_right);
}

template<typename T>
inline bool SegmentTree<T>::Is_valid_index(int index) {
	return index >= 0 && index < size_m;
}

template<typename T>
SegmentTree<T>::SegmentTree(int size, const T& init_val, const FuncType& func)
	: init_val_m(init_val), size_m(size), rank_m((int)std::log2(size - 1) + 2), func_m(func) {

	val_p_m = new T[1 << rank_m];
	std::fill(val_p_m + (1 << (rank_m - 1)), val_p_m + (1 << rank_m), init_val_m);

	for (int i = (1 << (rank_m - 1)) - 1; i >= 1; --i) {
		val_p_m[i] = func_m(val_p_m[i * 2], val_p_m[i * 2 + 1]);
	}
}

template<typename T>
inline SegmentTree<T>::~SegmentTree() {
	delete[] val_p_m;
}

template<typename T>
void SegmentTree<T>::Update(int pos, const T& val) {
	assert(Is_valid_index(pos));

	int i = pos + (1 << (rank_m - 1));
	val_p_m[i] = val;
	while (i > 1) {
		i /= 2;
		val_p_m[i] = func_m(val_p_m[i * 2], val_p_m[i * 2 + 1]);
	}
}

template<typename T>
T SegmentTree<T>::Query(int range_left, int range_right) {
	assert(Is_valid_index(range_left));
	assert(Is_valid_index(range_right - 1));

	return Query_rec(range_left, range_right, 1, 0, 1 << (rank_m - 1));
}

template<typename T>
class Max {
public:
	const T& operator()(const T& a, const T& b) const {
		return std::max<T>(a, b);
	}
};

template<typename T>
class Min {
public:
	const T& operator()(const T& a, const T& b) const {
		return std::min<T>(a, b);
	}
};

#endif

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <numeric>
#include <bitset>
#include <limits>

using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<LL, LL> PP;
#define REP(i,a,n) for(int i = (a); i < (int)(n); ++i)
#define REPM(i,n,a) for(int i = ((n) - 1); i >= (a); --i)
#define FLOAT setprecision(16)
#define INSIDE(i,j,H,W) ((i) >= 0 && (i) < (H) && (j) >= 0 && (j) < (W))
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const double EPS = 1.0e-9;

template <class T, class U>
istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U>
ostream& operator<<(ostream& ost, pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N>
void Fill(T(&dest)[N], const TCompatible& val) { fill(begin(dest), end(dest), val); }
template <class T, class TCompatible, size_t M, size_t N>
void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
// all_of

#if 1234567891
#include <array>
#include <unordered_set>
#include <unordered_map>
template<typename T>
using PriorityQ = priority_queue<T, vector<T>, greater<T> >;	// コスト小を優先
template<class T>
struct IsIterable {
private:
	template<class Iterable>
	static auto Is_iterable(Iterable subject) -> decltype(std::begin(subject), std::end(subject), std::true_type()) {}
	static auto Is_iterable(...) -> decltype(std::false_type()) {}
public:
	typedef decltype(Is_iterable(std::declval<T>())) type;
	static bool const value = type::value;
};
template <class Container>
typename std::conditional<true, std::ostream&, typename std::enable_if<IsIterable<Container>::value>::type>::type
operator<<(ostream& ost, const Container& container) {
	for (auto it = begin(container); it != end(container); ++it) {
		if (it != begin(container)) ost << ' ';
		ost << *it;
	}
	return ost;
}
#endif

#if _DEBUG
#include "IntMod.h"
#include "Union_Find.h"
#include "Graph.h"
#endif
struct Line{
	LL a, b, c;
};

LL N, K;
Line L[40000];
Line X[40000];
Line Y[40000];
LL A[40000], B[40000], C[40000];

bool comp_x(Line& p, Line& q) {
	return -(double)p.a / p.b > -(double)q.a / q.b;
}

bool comp_y(Line& p, Line& q) {
	return -(double)p.b / p.a > -(double)q.b / q.a;
}

typedef pair<int, double> PPP;
PPP XX[40000];
PPP YY[40000];

LL tento_x(double x) {
	REP(i, 0, N) {
		Line& l = X[i];
		XX[i] = make_pair(i, (l.c - l.a * x) / l.b);
	}
	sort(XX, XX + N, [](PPP p, PPP q) {return p.second < q.second; });
	SegmentTree<int> S(N + 1, 0, plus<int>());
	LL ret = 0;
	REP(i, 0, N) {
		int z = XX[i].first;
		ret += S.Query(z, N);
		S.Update(z, 1);
	}
	return ret;
}

LL tento_y(double y) {
	REP(i, 0, N) {
		Line& l = Y[i];
		YY[i] = make_pair(i, (l.c - l.b * y) / l.a);
	}
	sort(YY, YY + N, [](PPP p, PPP q) {return p.second < q.second; });
	SegmentTree<int> S(N + 1, 0, plus<int>());
	LL ret = 0;
	REP(i, 0, N) {
		int z = YY[i].first;
		ret += S.Query(z, N);
		S.Update(z, 1);
	}
	return ret;
}

int main() {
	cin >> N;
	REP(i, 0, N) {
		int a, b, c;
		cin >> a >> b >> c;
		L[i] = Line{ a,b,c };
	}
	REP(i, 0, N) {
		X[i] = Y[i] = L[i];
	}
	sort(X, X + N, comp_x);
	sort(Y, Y + N, comp_y);
	
	LL C = (LL)N * (N - 1) / 2;
	double l = -1e18, r = 1e18;
	double ansx, ansy;
	REP(i, 0, 150) {
		double mid = (l + r) / 2;
		if (tento_x(mid) * 2 >= C) {
			r = mid;
		} else {
			l = mid;
		}
	}
	ansx = l;

	double d = -1e18, u = 1e18;
	REP(i, 0, 150) {
		double mid = (d + u) / 2;
		if (tento_y(mid) * 2 >= C) {
			u = mid;
		} else {
			d = mid;
		}
	}
	ansy = u;
	cout << FLOAT << ansx << ' ' << ansy << endl;
	return 0;
}

Measured memory_bytes: 5244