#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define rep2(i,s,n) for (int i = s; i < n; ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define tmax(a,b,c) max(a,max(b,c))
#define tmin(a,b,c) min(a,min(b,c))
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vs vector<string>
#define vc vector<char>
#define vb vector<bool>
#define vp vector<P>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using LP = pair<ll,ll>;
template<class T> istream& operator>>(istream& is,vector<T>& v) { for(T& t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream& os,const vector<T>& v) { for(T t:v){os<<t<<" ";} os<<"\n"; return os; }
void Yes(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YES(bool b) { cout << (b ? "YES" : "NO") << endl; }
template<class T> inline bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}
template<class T> inline bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}
const int inf = 1001001001;
const ll linf = 1001001001001001001;

template<typename T>
class BIT {
    int n;
    vector<T> val;
public:
    BIT(int n):n(n),val(n+1,0) {}
    void add(int i,T x=1) {
        i++;
        while(i <= n) {
            val[i] += x;
            i += i&-i;
        }
    }
    T sum(int i) {
        T ret = 0;
        i++;
        while(i > 0) {
            ret += val[i];
            i -= i&-i;
        }
        return ret;
    }
    // [l,r)
    T sum(int l,int r) { return sum(r-1)-sum(l-1); }
};

ll inversion_number(int n,const vi& v) {
    ll ret = 0;
    BIT<int> bt(n);
    rep(i,n) {
        ret += i-bt.sum(v[i]);
        bt.add(v[i]);
    }
    return ret;
}

const double eps = 1e-9;
const double PI = acos(-1);
bool eq(double a,double b) { return abs(a-b) < eps; }

struct point {
    double x,y;
    point(double x,double y):x(x),y(y){}
    point operator+(const point a) const{ return {x+a.x,y+a.y}; }
    point operator-(const point a) const{ return {x-a.x,y-a.y}; }
    point operator*(const double a) const{ return {x*a,y*a}; }
    point operator/(const double a) const{ return {x/a,y/a}; }
    point operator-() const{ return *this*(-1); }
    bool operator==(const point a) const{ return eq(x,a.x) && eq(y,a.y); }
    bool operator!=(const point a) const{ return !(*this == a); }
    double abs() { return sqrt(x*x+y*y); }
    point rot90() { return point(-y,x); }
    double arg() { return atan2(y,x);}
};
double dist(point a,point b) { return (a-b).abs(); }
double dot(point a,point b) { return a.x*b.x+a.y*b.y; }
double cross(point a,point b) { return a.x*b.y-a.y*b.x; }
point mid(point a,point b) { return (a+b)/2; }
struct line {
    point a,b;
    line(point a,point b):a(a),b(b) {}
    bool online(point p) { return eq(cross(b-a,p-a),0.0); }
    double dist(point p) { return abs(cross(b-a,p-a))/(b-a).abs(); }
    line vertical_bisector() { return line(mid(a,b),mid(a,b)+(b-a).rot90()); }
};
bool operator<(line l,line m) {
    return (l.b-l.a).y/(l.b-l.a).x < (m.b-m.a).y/(m.b-m.a).x;
}
bool vertical(line l,line m) { return eq(dot(l.a-l.b,m.a-m.b),0.0); }
bool parallel(line l,line m) { return eq(cross(l.a-l.b,m.a-m.b),0.0); }
bool intersect(line l,line m) { //for seg_line
    return (cross(l.b-l.a,m.a-l.a)*cross(l.b-l.a,m.b-l.a) < eps) &&
            (cross(m.b-m.a,l.a-m.a)*cross(m.b-m.a,l.b-m.a) < eps);
}
point intersection(line l,line m) {
    assert(!parallel(l,m));
    return l.a+(l.b-l.a)*cross(m.b-m.a,m.a-l.a)/cross(m.b-m.a,l.b-l.a);
}
point gaisin(point a,point b,point c) {
    return intersection(line(a,b).vertical_bisector(),line(b,c).vertical_bisector());
}
struct circle {
    point o;
    double r;
    inline circle(point o,double r):o(o),r(r) {}
};
vector<point> intersection(circle a,circle b) {
    double d = dist(a.o,b.o);
    if(eq(a.r+b.r,d)) return {a.o+(b.o-a.o)*a.r/d};
    if(eq(a.r-b.r,d)) return {a.o+(b.o-a.o)*a.r/d};
    if(eq(b.r-a.r,d)) return {b.o+(a.o-b.o)*b.r/d};
    if(abs(a.r-b.r)+eps > d || d+eps > a.r+b.r) return {};
    double x = (pow(a.r,2.0)+pow(d,2.0)-pow(b.r,2.0))/(2*d);
    double y = sqrt(pow(a.r,2.0)-pow(x,2.0));
    point p = (b.o-a.o).rot90()*y/d;
    point tomid = a.o+(b.o-a.o)*x/d;
    return {tomid+p,tomid-p};
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    int n;
    cin >> n;
    vector<line> v,u;
    rep(i,n) {
        double a,b,c;
        cin >> a >> b >> c;
        point p(0,c/b),q(1,(c-a)/b);
        v.eb(p,q);
        u.eb(point(p.y,-p.x),point(q.y,-q.x));
    }
    sort(rall(v));
    sort(rall(u));
    double ok = 1e9,ng = -1e9;
    rep(i,80) {
        double mid = (ok+ng)/2;
        vector<pair<double,int>> now;
        rep(j,n) {
            double d = (v[j].a+(v[j].b-v[j].a)*((mid-v[j].a.x)/(v[j].b.x-v[j].a.x))).y;
            now.eb(d,j);
        }
        sort(all(now));
        vector<int> nowv;
        rep(j,n) nowv.pb(now[j].second);
        int cnt = inversion_number(n,nowv);
        if(cnt >= (n*(n-1)/2+1)/2) ok = mid;
        else ng = mid;
    }
    cout << fixed << setprecision(10) << ok << " ";
    ok = 1e9,ng = -1e9;
    rep(i,80) {
        double mid = (ok+ng)/2;
        vector<pair<double,int>> now;
        rep(j,n) {
            double d = (u[j].a+(u[j].b-u[j].a)*((mid-u[j].a.x)/(u[j].b.x-u[j].a.x))).y;
            now.eb(d,j);
        }
        sort(all(now));
        vector<int> nowu;
        rep(j,n) nowu.pb(now[j].second);
        int cnt = inversion_number(n,nowu);
        if(cnt >= (n*(n-1)/2+1)/2) ok = mid;
        else ng = mid;
    }
    cout << ok << endl;
}


Measured memory_bytes: 5276