#include <bits/stdc++.h>
using namespace std;
int n;
vector<pair<int, int> > a(41);
bool go(int k) {
  int ly = 100000, ry = -1, lx = 19999999, rx = -1;
  for (int i = 0; i < 4 * n + 1; i++) {
    if (i == k) continue;
    ly = min(ly, a[i].second);
    ry = max(ry, a[i].second);
    lx = min(lx, a[i].first);
    rx = max(rx, a[i].first);
  }
  for (int i = 0; i < 4 * n + 1; i++) {
    if (i == k) continue;
    if (a[i].first != lx and a[i].first != rx and a[i].second != ly and
        a[i].second != ry) {
      return false;
    }
  }
  if (rx - lx != ry - ly) return false;
  return true;
}
signed main() {
  cin >> n;
  for (int i = 0; i < 4 * n + 1; i++) {
    int x, y;
    cin >> a[i].first >> a[i].second;
  }
  for (int i = 0; i < n * 4 + 1; i++) {
    if (go(i)) {
      cout << a[i].first << " " << a[i].second;
      return 0;
    }
  }
  return 0;
}
