#include <bits/stdc++.h>
using namespace std;
#define T(n,i) for(int i = 0; i < (n); ++i)

const int S = 48600;
int bit[S], A[S], B[S], C[S], e[S];
pair<long double, int> d[S];

int main(){
	int N; scanf("%d", &N);
	T(N, i) scanf("%d%d%d", &A[i], &B[i], &C[i]);

	T(2, o){
		T(N, i) d[i] = {(C[i] - A[i] * -1e9L) / B[i], i};
		sort(d, d + N);
		T(N, i) e[d[i].second] = i;

		auto l = -1e9L, r = 1e9L;
		T(80, p){
			auto m = (l + r) / 2;
			T(N, i) d[i] = {(C[i] - A[i] * m) / B[i], i};
			sort(d, d + N);

			T(S, i) bit[i] = 0;
			long a = 0;
			T(N, i){
				int aj = e[d[i].second], j = aj+1;
				a += aj;
				for(; j; j -= j&-j) a -= bit[j-1];
				for(j = aj+1; j <= S; j += j&-j) ++bit[j-1];
			}
			if(a < (N*(N-1) + 2) / 4) l = m;
			else r = m;
		}

		printf("%.9Lf%s", l, o ? "\n" : " ");
		swap(A, B);
	}

	return 0;
}
