#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<pair<int, int> > a(4 * n + 1);
  vector<vector<int> > maps(55, vector<int>(55, 0));
  for (int i = 0; i < 4 * n + 1; i++) {
    cin >> a[i].first >> a[i].second;
    maps[a[i].first][a[i].second] = 1;
  }
  vector<int> borders(4);
  sort(a.begin(), a.end());
  for (pair<int, int> xy : a) {
    auto [r, c] = xy;
    int cnt = 0;
    for (int c = 0; c < 55; c++)
      if (maps[r][c]) cnt++;
    if (cnt >= 2) {
      borders[0] = r;
      break;
    }
  }
  sort(a.rbegin(), a.rend());
  for (pair<int, int> xy : a) {
    auto [r, c] = xy;
    int cnt = 0;
    for (int c = 0; c < 55; c++)
      if (maps[r][c]) cnt++;
    if (cnt >= 2) {
      borders[1] = r;
      break;
    }
  }
  sort(a.begin(), a.end(), [&](pair<int, int> x, pair<int, int> y) {
    return (x.second < y.second);
  });
  for (pair<int, int> xy : a) {
    auto [r, c] = xy;
    int cnt = 0;
    for (int r = 0; r < 55; r++)
      if (maps[r][c]) cnt++;
    if (cnt >= 2) {
      borders[2] = c;
      break;
    }
  }
  sort(a.begin(), a.end(),
       [&](pair<int, int> x, pair<int, int> y) { return x.second > y.second; });
  for (pair<int, int> xy : a) {
    auto [r, c] = xy;
    int cnt = 0;
    for (int r = 0; r < 55; r++)
      if (maps[r][c]) cnt++;
    if (cnt >= 2) {
      borders[3] = c;
      break;
    }
  }
  for (int c = borders[2]; c <= borders[3]; c++) {
    maps[borders[0]][c] = 0;
    maps[borders[1]][c] = 0;
  }
  for (int r = borders[0]; r <= borders[1]; r++) {
    maps[r][borders[2]] = 0;
    maps[r][borders[3]] = 0;
  }
  pair<int, int> ans;
  for (int i = 0; i < 55; i++)
    for (int j = 0; j < 55; j++)
      if (maps[i][j]) ans = {i, j};
  cout << ans.first << " " << ans.second << '\n';
}
