#include <bits/stdc++.h>
using namespace std;
const int inf = 1 << 30;
const long long maxn = 510;
int N;
int x[maxn], y[maxn];
bool judge(int t) {
  int by = inf, ty = -inf, lx = inf, rx = -inf;
  for (int i = 1; i <= N; ++i)
    if (i != t) {
      by = min(by, y[i]);
      ty = max(ty, y[i]);
      lx = min(lx, x[i]);
      rx = max(rx, x[i]);
    }
  bool flag = true;
  for (int i = 1; i <= N; ++i)
    if (i != t) {
      if (x[i] != lx && x[i] != rx && y[i] != by && y[i] != ty) {
        flag = false;
        break;
      }
    }
  if (flag && ty - by == rx - lx)
    return true;
  else
    return false;
}
int main() {
  cin >> N;
  N = 4 * N + 1;
  for (int i = 1; i <= N; ++i) cin >> x[i] >> y[i];
  for (int i = 1; i <= N; ++i) {
    if (judge(i)) {
      cout << x[i] << " " << y[i] << endl;
      break;
    }
  }
  return 0;
}
