#include <bits/stdc++.h>
using namespace std;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N; cin >> N;
    int total = 2 * N;
    vector<pair<int,int>> pts(total);
    for (int i = 0; i < total; i++){
        cin >> pts[i].first >> pts[i].second;
    }
    vector<pair<int,int>> cand = {
        {1,0}, {0,1}, {1,1}, {1,-1},
        {1,2}, {2,1}, {1,-2}, {2,-1},
        {1,3}, {3,1}, {1,-3}, {3,-1},
        {2,3}, {3,2}, {2,-3}, {3,-2},
        {1,4}, {4,1}, {1,-4}, {4,-1}
    };
    for(auto &p : cand){
        int a = p.first, b = p.second;
        int maxScale = 100000;
        if(a != 0) maxScale = min(maxScale, 100000 / abs(a));
        if(b != 0) maxScale = min(maxScale, 100000 / abs(b));
        vector<long long> base(total);
        for (int i = 0; i < total; i++){
            base[i] = (long long)a * pts[i].first + (long long)b * pts[i].second;
        }
        sort(base.begin(), base.end());
        long long gap = base[N] - base[N - 1];
        if(gap <= 0) continue;
        long long k_min = (2 + gap - 1) / gap; // 即 ceil(2 / gap)
        if(k_min < 1) k_min = 1;
        if(k_min <= maxScale){
            int A = a * k_min, B = b * k_min;
            long long C = -(base[N - 1] * k_min + 1);
            cout << A << " " << B << " " << C;
            return 0;
        }
    }
    vector<int> xs(total);
    for (int i = 0; i < total; i++){
        xs[i] = pts[i].first;
    }
    sort(xs.begin(), xs.end());
    int A = 2, B = 0;
    long long C = -(2LL * xs[N - 1] + 1);
    cout << A << " " << B << " " << C;
    return 0;
}