#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int N = 1000005;
const double PI = 4 * atan(1);
const double eps = 1e-7;
pair<long long, long long> a[N];
long long n;
long long get(long long x, long long y) {
  vector<pair<long long, long long> > v;
  long long minx = 1e17;
  long long miny = 1e17;
  long long maxx = -1e17;
  long long maxy = -1e17;
  for (int i = 0; i <= 4 * n; i++) {
    if (x == a[i].first && y == a[i].second) continue;
    minx = min(minx, a[i].first);
    maxx = max(maxx, a[i].first);
    miny = min(miny, a[i].second);
    maxy = max(maxy, a[i].second);
    v.push_back(make_pair(a[i].first, a[i].second));
  }
  if (maxx == minx) {
    return 0;
  }
  if (maxy == miny) {
    return 0;
  }
  if (maxx - minx != maxy - miny) {
    return 1;
  }
  sort((v).begin(), (v).end());
  long long cnt = 0;
  for (int i = 0; i < v.size(); i++) {
    if (v[i].first == minx || v[i].first == maxx) {
      cnt += (v[i].second > maxy || v[i].second < miny);
    } else if (v[i].second == miny || v[i].second == maxy) {
      cnt += (v[i].first > maxx || v[i].first < minx);
    } else {
      cnt++;
    }
  }
  return cnt;
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n;
  for (int i = 0; i <= 4 * n; i++) {
    long long x, y;
    cin >> x >> y;
    a[i] = {x, y};
  }
  sort(a, a + n);
  for (int i = 0; i <= 4 * n; i++) {
    long long nb = get(a[i].first, a[i].second);
    if (nb == 0) {
      cout << a[i].first << " " << a[i].second;
      return 0;
    }
  }
  return 0;
}
