#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
struct Pt {
    int x, y;
};
 
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;
    cin >> N;
    int total = 2 * N;
    vector<Pt> pts(total);
    for (int i = 0; i < total; i++){
        cin >> pts[i].x >> pts[i].y;
    }
    vector<Pt> ptsY = pts;
    sort(ptsY.begin(), ptsY.end(), [](const Pt &a, const Pt &b){
        return a.y < b.y;
    });
    if(ptsY[N-1].y < ptsY[N].y){
        int y1 = ptsY[N-1].y, y2 = ptsY[N].y;
        int a = 0, b = 2, c = -(y1 + y2);
        cout << a << " " << b << " " << c << "\n";
        return 0;
    }
    vector<Pt> ptsX = pts;
    sort(ptsX.begin(), ptsX.end(), [](const Pt &a, const Pt &b){
        return a.x < b.x;
    });
    if(ptsX[N-1].x < ptsX[N].x){
        int x1 = ptsX[N-1].x, x2 = ptsX[N].x;
        int a = 2, b = 0, c = -(x1 + x2);
        cout << a << " " << b << " " << c << "\n";
        return 0;
    }
    vector<int> S(total);
    for(int i = 0; i < total; i++){
        S[i] = pts[i].x + pts[i].y;
    }
    sort(S.begin(), S.end());
    if(S[N-1] < S[N]){
        int s1 = S[N-1], s2 = S[N];
        int a = 2, b = 2, c = -(s1 + s2);
        cout << a << " " << b << " " << c << "\n";
        return 0;
    }
    cout << 1 << " " << 0 << " " << -100 << "\n";
    return 0;
}