#include <bits/stdc++.h>
using namespace std;
const int maxn = 55;
const int d[4][2]{1, 0, -1, 0, 0, 1, 0, -1};
int n;
vector<int> x_appere(maxn), y_appere(maxn), x, y;
stack<pair<int, int> > q;
int main() {
  ios::sync_with_stdio(0);
  cin >> n;
  for (int i = (1); i <= (4 * n + 1); ++i) {
    int xx, yy;
    cin >> xx >> yy;
    x_appere[xx]++, y_appere[yy]++;
    x.push_back(xx), y.push_back(yy);
    q.push(make_pair(xx, yy));
  }
  sort(x.begin(), x.end()), sort(y.begin(), y.end());
  int x_left = -1, x_right = -1, y_up = -1, y_down = -1;
  for (int i = (0); i < (x.size()); ++i) {
    if (x_appere[x[i]] >= 2) {
      x_left = x[i];
      break;
    }
  }
  for (int i = (0); i < (y.size()); ++i) {
    if (y_appere[y[i]] >= 2) {
      y_down = y[i];
      break;
    }
  }
  sort(x.begin(), x.end(), greater<int>()),
      sort(y.begin(), y.end(), greater<int>());
  for (int i = (0); i < (x.size()); ++i) {
    if (x_appere[x[i]] >= 2) {
      x_right = x[i];
      break;
    }
  }
  for (int i = (0); i < (y.size()); ++i) {
    if (y_appere[y[i]] >= 2) {
      y_up = y[i];
      break;
    }
  }
  while (!q.empty()) {
    int xx = q.top().first, yy = q.top().second;
    q.pop();
    if ((xx != x_left && xx != x_right) && (yy != y_down && yy != y_up)) {
      cout << xx << " " << yy << endl;
      break;
    } else if (xx > x_right || xx < x_left || yy > y_up || yy < y_down) {
      cout << xx << " " << yy << endl;
      break;
    }
  }
}
