#include <bits/stdc++.h>
using namespace std;
pair<int, int> p[10];
int main() {
  int n;
  cin >> n;
  n = 4 * n + 1;
  for (int i = 0; i < n; i++) {
    cin >> p[i].first >> p[i].second;
  }
  vector<int> v;
  for (int x1 = 0; x1 < 50; x1++) {
    for (int x2 = x1 + 1; x2 <= 50; x2++) {
      for (int y1 = 0; y1 <= 50; y1++) {
        int y2 = y1 + (x2 - x1);
        for (int i = 0; i < n; i++) {
          if ((p[i].first == x1 || p[i].first == x2) &&
              (p[i].second >= y1 && p[i].second <= y2))
            continue;
          else if ((p[i].second == y1 || p[i].second == y2) &&
                   (p[i].first >= x1 && p[i].first <= x2))
            continue;
          else
            v.push_back(i);
        }
        if (v.size() == 1) {
          cout << p[v[0]].first << " " << p[v[0]].second << endl;
          return 0;
        }
        v.clear();
      }
    }
  }
}
