#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) maxScale = min(maxScale, 100000 / abs(a));
        if(b) maxScale = min(maxScale, 100000 / abs(b));
        for (int k = 1; k <= maxScale; k++){
            int A = a * k, B = b * k;
            vector<long long> vals(total);
            for (int i = 0; i < total; i++){
                vals[i] = (long long)A * pts[i].first + (long long)B * pts[i].second;
            }
            sort(vals.begin(), vals.end());
            if(vals[N] - vals[N - 1] >= 2){
                long long C = -(vals[N - 1] + 1);
                cout << A << " " << B << " " << C;
                return 0;
            }
        }
    }
	assert(1 == 0);
    return 0;
}