#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 2e9;
const int MAXN = 1e6;
vector<pair<int, int>> P;
int R[53];
int C[53];
vector<int> r;
vector<int> c;
signed main() {
  int n;
  scanf("%d", &n);
  memset(R, 0, sizeof(R));
  memset(C, 0, sizeof(C));
  int x, y;
  for (int i = 0; i < 4 * n + 1; i++) {
    scanf("%d %d", &x, &y);
    x += 1;
    y += 1;
    R[x]++;
    C[y]++;
    P.emplace_back(pair<int, int>(x, y));
  }
  for (int i = 0; i < 53; i++) {
    if (R[i] >= n) r.emplace_back(i);
    if (C[i] >= n) c.emplace_back(i);
  }
  int r1 = r[0];
  int r2 = r[r.size() - 1];
  int c1 = c[0];
  int c2 = c[c.size() - 1];
  for (int i = 0; i < 4 * n + 1; i++) {
    if ((P[i].first < r1 || P[i].first > r2 || P[i].second < c1 ||
         P[i].second > c2) ||
        (P[i].first != r1 && P[i].first != r2 && P[i].second != c1 &&
         P[i].second != c2))
      printf("%d %d\n", P[i].first - 1, P[i].second - 1);
  }
}
