#include <bits/stdc++.h>
#include <unistd.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
 
 
typedef long long ll;
//#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { -1,0, 1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
// #define mp make_pair
//#define endl '\n'



template <typename T>
class SegmentTree {
public:
  using F = function<T(T&, T&)>;
  int n;
  vector<T > dat;
  T e; // 単位元
  F query_func;
  F update_func;
  
  SegmentTree(vector<T> a, F query_func, F update_func, T e) :n(a.size()), query_func(query_func), update_func(update_func), e(e) {
    dat.resize(4 * n);
    init(0, 0, n, a);
  }

  void init(int k, int l, int r, vector<T> &a) {
    if (r - l == 1) {
      dat[k] = a[l];
    }
    else {
      int lch = 2 * k + 1, rch = 2 * k + 2;
      init(lch, l, (l + r) / 2, a);
      init(rch, (l + r) / 2, r, a);
      dat[k] = query_func(dat[lch], dat[rch]);
    }
  }

  //k番目の値をaに変更
  void update(int k, T a, int v, int l, int r) {
    if (r - l == 1) {
      dat[v] = update_func(dat[v], a);
    }
    else {
      if (k < (l + r) / 2)
        update(k, a, 2 * v + 1, l, (l + r) / 2);
      else {
        update(k, a, 2 * v + 2, (l + r) / 2, r);
      }
      dat[v] = query_func(dat[v * 2 + 1], dat[v * 2 + 2]);
    }
  }
    

  //[a,b)の最小値を求める
  //後ろのほうの引数は計算の簡単のための引数
  //kは接点の番号,l,rはその接点が[l,r)に対応していることを表す
  //従って、外からはquery(a,b,0,0,n)としてよぶ
  T query(int a, int b, int k, int l, int r) {
    if (r <= a || b <= l) {
      return e;
    }
    if (a <= l && r <= b) {
      return dat[k];
    }
    else {
      T ul = query(a, b, k * 2 + 1, l, (l + r) / 2);
      T ur = query(a, b, k * 2 + 2, (l + r) / 2, r);
      return query_func(ul, ur);
    }
  }
};


bool cmp(pair<pii, int> a, pair<pii, int> b) {
  return (double)a.first.first / a.first.second < (double)b.first.first / b.first.second;
}

int f1(int a, int b) {
  return a + b;
}
int f2(int a, int b) {
  return a + b;
}

class Bit {
public:
	int n;
	vl bit; // 0-index

	Bit(int _n) { n = _n; bit.resize(n); }

	// [0, i)の和
	ll sum(int i) {
		ll s = 0;
		while (i > 0) {
			s += bit[i - 1];
			i -= i & -i;
		}
		return s;
	}

	//iは0-index
	void add(int i, ll x) {
		i++;
		while (i <= n) {
			bit[i - 1] += x;
			i += i & -i;
		}
	}
};

double solve(int n, vi a, vi b, vi c) {
  rep (i, n) {
    if (b[i] < 0) {
      a[i] *= -1;
      b[i] *= -1;
      c[i] *= -1;
    }
  }

  vector<pair<pii, int>> abc(n);
  rep (i, n) {
    abc[i].first.first = a[i];
    abc[i].first.second = b[i];
    abc[i].second = c[i];
  }
  sort(all(abc), cmp);
  //DEBUG_VEC(abc);
  rep (i, n) {
    a[i] = abc[i].first.first;
    b[i] = abc[i].first.second;
    c[i] = abc[i].second;
  }

  /*
  DEBUG_VEC(a);
  DEBUG_VEC(b);
  DEBUG_VEC(c);
  //*/
  
  double ng = -inf, ok = inf;
  int threshold = ((n * (n - 1) / 2) + 1) / 2;
  //DEBUG(threshold);
  rep (_, 65) {
    double mid = (ng + ok) / 2;
    vector<double> value(n);
    set<double> st;
    rep (i, n) {
      value[i] = (double)(c[i] - mid*a[i]) / b[i];
      st.insert(value[i]);
    }
    map<double, int> mp;
    int cnt = 0;
    for (auto itr = st.begin(); itr != st.end(); itr++) {
      mp[*itr] = cnt++;
    }

    vi value_int(n);
    vi num(cnt);
    rep (i, n) {
      value_int[i] = mp[value[i]];
      num[value_int[i]]++;
    }
    
    //DEBUG_VEC(value);
    //DEBUG_VEC(value_int);
    //SegmentTree<int> big(num, f1, f2, 0), small(vi(cnt), f1, f2, 0);
    Bit big(cnt), small(cnt);
    rep (i, cnt) {
      big.add(i, num[i]);
    }
    
    int smaller = 0;
    rep (i, n) {
      int x = value_int[i];
      big.add(x, -1);

      /*
      rep (i, cnt) {
        cout << big.query(i, i + 1, 0, 0, big.n) << " ";
      }
      cout << endl;
      rep (i, cnt) {
        cout << small.query(i, i + 1, 0, 0, small.n) << " ";
      }
      cout << endl;
      //*/

      smaller += big.sum(x + 1);
      smaller += small.sum(cnt) - small.sum(x);
      //smaller += big.query(0, x + 1, 0, 0, big.n);
      //smaller += small.query(x, small.n, 0, 0, small.n);
      small.add(x, 1);
      //DEBUG(smaller);
    }
    assert((smaller & 1) == 0);
    smaller >>= 1;
    //DEBUG(mid);
    //DEBUG(smaller);
    if (smaller >= threshold) {
      ok = mid;
    }
    else {
      ng = mid;
    }
  }
  return ok;
}

signed main() {
  fio();
  int n;
  cin >> n;
  vi a(n), b(n), c(n);
  rep (i, n) cin >> a[i] >> b[i] >> c[i];
  //DEBUG("X");
  double x = solve(n, a, b, c);
  //DEBUG("Y");
  double y = solve(n, b, a, c);
  cout << setprecision(15) << fixed;
  cout << x << " " << y << endl;
}


Measured memory_bytes: 9412