#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main() {
    int n; cin >> n;

    vector<pair<int, int>> v(n);

    for(int i = 0; i < n; i++) {
        cin >> v[i].first >> v[i].second;
    }

    sort(v.begin(), v.end());
    

    int half = (n-1)/2;

    printf("%d %d\n%d %d\n", v[half].first, v[half].second, v[half].first,
            v[half].second + 1);

    return 0;
}