#include <bits/stdc++.h>
#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)
using ll = std::int64_t;
using ull = std::uint64_t;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); }
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, std::size_t s, Tail... tail) { auto v = std::move(make_v(init, tail...)); return vec<decltype(v)>(s, v); }
template <typename T, std::size_t Head, std::size_t ...Tail> struct multi_dem_array { using type = std::array<typename multi_dem_array<T, Tail...>::type, Head>; };
template <typename T, std::size_t Head> struct multi_dem_array<T, Head> { using type = std::array<T, Head>; };
template <typename T, std::size_t ...Args> using mdarray = typename multi_dem_array<T, Args...>::type;
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; }

namespace tree {

template <typename T>
struct BIT {
    vec<T> data;
    T id_ele;

    BIT(ll size, T id_ele) : id_ele(id_ele) {
        ll bsize = 1;
        while (bsize < size) bsize *= 2;
        data = vec<T>(bsize + 1, id_ele);
    }

    T sum(ll pos) {
        T ret = id_ele;
        for (; 0 < pos; pos -= pos & -pos) ret += data[pos];
        return ret;
    }

    T sum(ll l, ll r) { return sum(r) - sum(l); }

    void add(ll pos, T delta) {
        for (++pos; pos < data.size(); pos += pos & -pos) data[pos] += delta;
    }
};

}

const double inf = 5e15;

double solve(vec<tll> &lines) {
    ll n = lines.size();

    auto til = [](tll t) {
        ll a, b;
        std::tie(a, b, std::ignore) = t;
        return static_cast<double>(a) / b;
    };

    auto val = [](tll t, double x) {
        ll a, b, c;
        std::tie(a, b, c) = t;
        return (-a * x + c) / b;
    };
    
    std::sort(ALL(lines), [&](tll a, tll b) { return til(a) > til(b); });
    tree::BIT<ll> bt(n + 10, 0);
    vec<double> vals(n);
    vec<ll> ord(n), rord(n);
    std::iota(ALL(ord), 0);
    double ok = inf, ng = -inf;
    for (ll loop = 0; loop < 100; loop++) {
        ll cnt = 0;
        double mid = (ok + ng) / 2;
        std::fill(ALL(bt.data), 0);
        for (ll i = 0; i < n; i++) vals[i] = val(lines[i], mid);
        std::sort(ALL(ord), 
                  [&](ll i, ll j) {
                      double a = vals[i], b = vals[j];
                      if (a != b) return a < b;
                      else return i < j;
                  });
        for (ll i = 0; i < n; i++) rord[ord[i]] = i;
        for (ll i = 0; i < n; i++) {
            ll idx = rord[i];
            cnt += bt.sum(0, idx);
            bt.add(idx, 1);
        }
        ll sum = n * (n - 1) / 2;
        (sum / 2 + (sum & 1) <= cnt ? ok : ng) = mid;
    }

    return ok;
}

int main() {
    ll n;
    std::cin >> n;
    vec<tll> abc(n);
    for (auto &&e : abc) {
        ll a, b, c;
        std::cin >> a >> b >> c;
        e = tll(a, b, c);
    }

    double x = solve(abc);
    for (auto &&e : abc) std::swap(std::get<0>(e), std::get<1>(e));
    double y = solve(abc);
    std::cout << x << ' ' << y << std::endl;
    return 0;
}


Measured memory_bytes: 2688