#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}
  //C++14
  // tuple_util::apply( function, result, tuple<args>)
  #include <tuple>
  #include <utility>
  namespace tuple_util{
    template<class F, class R, class ... Args, size_t... I> void apply(F& f, R& res, tuple<Args...>& t, index_sequence<I...>){ res = f( get<I>(t)... ); }
    template<class F, class R, class ... Args> void apply(F& f, R& res, tuple<Args...>& t){ apply(f,res,t, index_sequence_for<Args...>{} ); }
    template<class T, size_t ... I> void input (istream& is, T& t, index_sequence<I...>){ using s=int[]; (void)s{(void(is>>get<I>(t)),0)...} ; }
    template<class T, size_t ... I> void output(ostream& os, T& t, index_sequence<I...>){ using s=int[]; (void)s{(void(os<<get<I>(t)<<" "),0)...} ; }
  }
  template<class... Args> istream& operator >> (istream& is, tuple<Args...>& t){ tuple_util::input (is, t, index_sequence_for<Args...>{}); return is;}
  template<class... Args> ostream& operator << (ostream& os, tuple<Args...>& t){ tuple_util::output(os, t, index_sequence_for<Args...>{}); return os;}
  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;


class BinaryIndexedTree_1_indexed{
  void init(const vector<int> &A){
    for(int i=0; i<N; i++){
      add(i+1, A[i]);
    }
  }
  
public:
  vector<int> T;
  int N;
  
  BinaryIndexedTree_1_indexed(const int n) : T(n+1,0), N(n){
    
  }
  
  BinaryIndexedTree_1_indexed(const vector<int> &A) : T(A.size()+1,0), N(A.size()){
    init(A);
  }

  //caution : position "i" must be 1-indexed
  void add(int i, const int x){
    while(i <= N){
      T[i] += x;
      i += i & -i;
    }
  }

  //get sums [0,i]
  int get_sum(int i){
    int ret=0;
    while(i>0){
      ret += T[i];
      i -= i & -i;
    }
    return ret;
  }

  //get sums [from,to]
  int get_sums_range(const int from, const int to){
    return get_sum(to) - get_sum(from-1);
  }

  //get at [i]
  int get_at(const int i){
    return get_sum(i) - get_sum(i-1);
  }

  int lower_bound(int val){
    if(val<=0) return 0;
    int x = 0;
    int k = 1;
    while((k<<1) <= N) k<<=1;
    
    for( ; k>0; k>>=1){
      if( x+k <= N && T[x+k] < val ){
        val -= T[x+k];
        x += k;
      }
    }
    return x+1;
  }

  void print(){
    for(int i=0; i<=N; i++){
      cerr << T[i] << " ";
    }
    cerr << endl;
  }
};


int main(){
  int n;
  cin >> n;

  using tt = tuple<long long,long long,long long>;
  vector<tt> L(n);
  cin >> L;
  sort(L.begin(), L.end(), [](tt a, tt b){
    return -get<0>(a)*1.0/get<1>(a) > -get<0>(b)*1.0/get<1>(b);
  });

  auto check = [&](double x) -> long long{
    long long cnt = 0;
    BinaryIndexedTree_1_indexed A(n+1);
    vector<pair<double,int>> w(n);
    for(int i=0; i<n; i++){
      long long a,b,c;
      tie(a,b,c) = L[i];
      double y = (-a*x+c)/b;
      w[i] = {y,i};
    }
    sort(w.begin(), w.end());
    for(int i=0; i<n; i++){
      int j = w[i].second + 1;
      long long tmp = A.get_sum(j);
      A.add(j, 1);
      cnt += i-tmp;
    }
    return cnt;
  };

  auto calc = [&]() -> double{
    double lb = -1e9;
    double ub = +1e9;
    for(int i=0; i<100 && (ub-lb)>1e-10; i++){
      double mid = (lb+ub)*0.5;
      long long t = check(mid);
      if( t < ((n*(n-1))/2+1)/2 ){
        lb = mid;
      }else{
        ub = mid;
      }
    }
    return lb;
  };

  double x = calc();
  for(int i=0; i<n; i++){
    long long a,b,c;
    tie(a,b,c) = L[i];
    L[i] = make_tuple(b,a,c);
  }
  sort(L.begin(), L.end(), [](tt a, tt b){
    return -get<0>(a)*1.0/get<1>(a) > -get<0>(b)*1.0/get<1>(b);
  });

  double y = calc();

  printf("%.16f %.16f\n", x,y);
  return 0;
}


Measured memory_bytes: 2028