#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);
    long long cx = 0, cy = 0;
    for (int i = 0; i < total; i++){
        int x, y; cin >> x >> y;
        pts[i] = {x, y};
        cx += x;
        cy += y;
    }
    cx /= total;
    cy /= total;
    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 &cb : cand){
        int a = cb.first, b = cb.second;
        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;
        }
    }
    for(auto &cb : cand){
        int a = cx + cb.first, b = cy + cb.second;
        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;
        }
    }
    return 0;
}