#include <bits/stdc++.h>
using namespace std;

#define rep(i, l, r) for (int i = (int)(l); i<(int)(r); i++)
#define ll long long

int main() {
    int N; cin >> N;
    ll X[2*N], Y[2*N];
    rep(i, 0, 2*N) cin >> X[i] >> Y[i];
    while(true) {
        int a = rand()%10000, b = rand()%10000;
        if (a == 0 and b == 0) continue;
        //ax + by = c'
        //ax + by <= c である領域に含まれる点の個数がN個以下
        ll ok = -20'000'000'000, ng = 20'000'000'000;
        bool f = false;
        while (ng-ok > 1) {
            ll mid = (ok+ng)/2;
            int cnt = 0;
            rep(i, 0, 2*N) {
                if (a * X[i] + b * Y[i] < mid) cnt++;
            }
            if (cnt <= N) ok = mid;
            else ng = mid;
        }
        //f(ok) == Nか
        ok--;
        int cnt1 = 0, cnt2 = 0;
        rep(i, 0, 2*N) if (a * X[i] + b * Y[i] < ok) cnt1++;
        rep(i, 0, 2*N) if (a * X[i] + b * Y[i] > ok) cnt2++;
        if (cnt1 == N and cnt2 == N) {
            cout << a << " " << b << " " << -ok << endl;
            break;
        }
        else continue;
    }
}