#include <iostream>
#include <vector>
#include <algorithm>
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>> ptsY = pts;
    sort(ptsY.begin(), ptsY.end(), [](const pair<int,int>& a, const pair<int,int>& b){
        return a.second < b.second;
    });
    if (ptsY[N-1].second < ptsY[N].second) {
        int yLow = ptsY[N-1].second;
        int yHigh = ptsY[N].second;
        int a = 0;
        int b = 2;
        int c = -(yLow + yHigh);
        cout << a << " " << b << " " << c << "\n";
        return 0;
    }
    vector<pair<int,int>> ptsX = pts;
    sort(ptsX.begin(), ptsX.end(), [](const pair<int,int>& a, const pair<int,int>& b){
        return a.first < b.first;
    });
    if (ptsX[N-1].first < ptsX[N].first) {
        int xLow = ptsX[N-1].first;
        int xHigh = ptsX[N].first;
        int a = 2;
        int b = 0;
        int c = -(xLow + xHigh);
        cout << a << " " << b << " " << c << "\n";
        return 0;
    }
    return 0;
}