#include <bits/stdc++.h>
using namespace std;
const long long int inf = 1e18, M = 1e9 + 7;
const long long int N = 60;
long long int a[N][N] = {0};
void solve() {
  long long int n;
  cin >> n;
  long long int x, y;
  for (long long int i = 0; i < 4 * n + 1; ++i) cin >> x >> y, a[x][y] = 1ll;
  long long int cnt, l, r, u, d;
  for (long long int i = 0; i < N; ++i) {
    cnt = 0ll;
    for (long long int j = 0; j < N; ++j) cnt += a[i][j];
    if (cnt >= n) {
      d = i;
      break;
    }
  }
  for (long long int i = N - 1; i >= 0; --i) {
    cnt = 0ll;
    for (long long int j = 0; j < N; ++j) cnt += a[i][j];
    if (cnt >= n) {
      u = i;
      break;
    }
  }
  for (long long int i = 0; i < N; ++i) {
    cnt = 0ll;
    for (long long int j = 0; j < N; ++j) cnt += a[j][i];
    if (cnt >= n) {
      l = i;
      break;
    }
  }
  for (long long int i = N - 1; i >= 0; --i) {
    cnt = 0ll;
    for (long long int j = 0; j < N; ++j) cnt += a[j][i];
    if (cnt >= n) {
      r = i;
      break;
    }
  }
  for (long long int i = 0; i < N; ++i) {
    for (long long int j = 0; j < N; ++j) {
      if (a[i][j]) {
        if (((d == i || i == u) && (l <= j && j <= r)) ||
            ((d <= i && i <= u) && (l == j || j == r)))
          ;
        else {
          cout << i << " " << j;
          return;
        }
      }
    }
  }
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
