#include <bits/stdc++.h>   using namespace std;   int main() {     int n;     cin >> n;     vector<int> yarr(51, 0);     vector<int> xarr(51, 0);     int q = 4 * n + 1;     vector<pair<int, int>> trav;     for (int i = 0; i < q; i++) {       int x, y;       cin >> x >> y;       trav.push_back(make_pair(x, y));       xarr[x]++;       yarr[y]++;     }     int maxy = 0;     int maxx = 0;     int minx = 1000, miny = 1000;     int indexx = 0, indexy = 0;     for (int i = 0; i < 51; i++) {       if (yarr[i] >= n && i > maxy) {         maxy = i;       }       if (xarr[i] >= n && i > maxx) {         maxx = i;       }       if (yarr[i] >= n && i < miny) {         miny = i;       }       if (xarr[i] >= n && i < minx) {         minx = i;       }     }     for (int i = 0; i < trav.size(); i++) {       if (trav[i].first == minx && trav[i].second >= miny &&           trav[i].second <= maxy)         continue;       if (trav[i].first == maxx && trav[i].second >= miny &&           trav[i].second <= maxy)         continue;       if (trav[i].second == miny && trav[i].first >= minx &&           trav[i].first <= maxx)         continue;       if (trav[i].second == maxy && trav[i].first >= minx &&           trav[i].first <= maxx)         continue;       cout << trav[i].first <<     << trav[i].second <<   n ;       break;     }   }   