#include <bits/stdc++.h>
using namespace std;
long long int inf = (1e18 + 2);
long long int power(long long int x, long long int y, long long int p) {
  long long int res = 1;
  x = x % p;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
vector<long long int> getUniqs(vector<long long int> vec) {
  sort((vec).begin(), (vec).end());
  auto itr = unique((vec).begin(), (vec).end());
  vec.resize(distance(vec.begin(), itr));
  return vec;
}
bool onBoundary(long long int x, long long int y, long long int xx1,
                long long int xx2, long long int yy1, long long int yy2) {
  return ((x == xx1 && (y >= yy1 && y <= yy2)) ||
          (x == xx2 && (y >= yy1 && y <= yy2)) ||
          (y == yy1 && (x >= xx1 && x <= xx2)) ||
          (y == yy2 && (x >= xx1 && x <= xx2)));
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n;
  cin >> n;
  long long int N = (4 * n) + 1;
  long long int x[N + 1];
  long long int y[N + 1];
  vector<long long int> xx;
  vector<long long int> yy;
  for (long long int i = 0; i < N; i++) {
    cin >> x[i] >> y[i];
    xx.push_back(x[i]);
    yy.push_back(y[i]);
  }
  xx = getUniqs(xx);
  yy = getUniqs(yy);
  long long int xx1, xx2, yy1, yy2, dist1, dist2;
  long long int onB = 0, X = -1, Y = -1;
  for (long long int z = 0; z < (long long int)(xx.size()); z++) {
    xx1 = xx[z];
    for (long long int w = z + 1; w < (long long int)(xx.size()); w++) {
      xx2 = xx[w];
      for (long long int p = 0; p < (long long int)(yy.size()); p++) {
        yy1 = yy[p];
        for (long long int o = p + 1; o < (long long int)(yy.size()); o++) {
          yy2 = yy[o];
          onB = 0;
          dist1 = max(xx1 - xx2, xx2 - xx1);
          dist2 = max(yy1 - yy2, yy2 - yy1);
          if (dist1 == dist2) {
            for (long long int i = 0; i < N; i++) {
              if (onBoundary(x[i], y[i], xx1, xx2, yy1, yy2))
                onB++;
              else {
                X = x[i];
                Y = y[i];
              }
            }
            if (onB == (N - 1)) {
              cout << X << " " << Y << endl;
              return 0;
            }
          }
        }
      }
    }
  }
  return 0;
}
