#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
#define out(args...){vector<string> a_r_g_s=s_p_l_i_t(#args, ','); e_r_r(a_r_g_s.begin(), args); }
vector<string> s_p_l_i_t(const string &s, char c){vector<string> v;int d=0,f=0;string t;for(char c:s){if(!d&&c==',')v.pb(t),t="";else t+=c;if(c=='\"'||c=='\'')f^=1;if(!f&&c=='(')++d;if(!f&&c==')')--d;}v.pb(t);return move(v);}
void e_r_r(vector<string>::iterator it) {}
template<typename T, typename... Args> void e_r_r(vector<string>::iterator it, T a, Args... args){ if(*it==" 1"||*it=="1") cerr<<endl; else cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << ", "; e_r_r(++it, args...);}
const ll MOD=1e9+7;

#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds;
template<class T> using SET=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
/*
setでできるものは大体できます。insert,erase,iterator関連・swapなど。
find_by_order 関数
var_name.find_by_order(k) でk番目（0-indexed）のiteratorを返します。
order_of_key 関数
var_name.order_of_key(key) でkey以上の最初の要素が、treeの中で何番目か返します。
 */

double solve(vector<ll> &a,vector<ll> &b,vector<ll> &c){
  int n=a.size();
  ll t=n*(n-1)/2;
  vector<int> ind(n); iota(all(ind),0);
  double l=-2e10,r=2e10;
  rep(_,100){
    double x=(l+r)/2;
    sort(all(ind),[&](int i,int j){ return (c[i]-a[i]*x)/b[i] < (c[j]-a[j]*x)/b[j];});
    SET<double> st;
    ll cnt=0;
    for(int i:ind){
      double r=(double)a[i]/b[i];
      cnt+=st.order_of_key(r);
      st.insert(r);
    }
    (t-cnt>=cnt?r:l)=x;
  }
  return r;
}

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(10);

  int n;
  cin>>n;
  vector<ll> a(n),b(n),c(n);
  rep(i,n) cin>>a[i]>>b[i]>>c[i];
  cout<<solve(a,b,c)<<" "<<solve(b,a,c)<<endl;
  return 0;
}


Measured memory_bytes: 5888