#include <bits/stdc++.h>
using namespace std;
int p[10005];
bool comparison(const pair<int, int> &a, const pair<int, int> &b);
bool comparison(const pair<int, int> &a, const pair<int, int> &b) {
  return a.second < b.second;
}
vector<pair<int, int> > v;
int f[55];
int d[55];
int main() {
  int n;
  cin >> n;
  vector<int> vf;
  vector<int> vc;
  for (int i = 0; i < 4 * n + 1; i++) {
    int p, q;
    cin >> p >> q;
    v.push_back(make_pair(p, q));
    f[p]++;
    d[q]++;
  }
  for (int i = 0; i < 55; i++) {
    if (f[i] > 1) vf.push_back(i);
  }
  for (int i = 0; i < 55; i++) {
    if (d[i] > 1) vc.push_back(i);
  }
  sort(vf.begin(), vf.end());
  sort(vc.begin(), vc.end());
  int x1 = vf[0];
  int y1 = vc[0];
  int x2 = vf[vf.size() - 1];
  int y2 = vc[vc.size() - 1];
  for (int i = 0; i < v.size(); i++) {
    if (v[i].first != x1 && v[i].second != y1 && v[i].first != x2 &&
        v[i].second != y2) {
      return cout << v[i].first << " " << v[i].second, 0;
    } else if (((v[i].first < x1) || (v[i].first > x2) || (v[i].second < y1) ||
                (v[i].second > y2))) {
      if ((v[i].first == x1 && v[i].second != y1) ||
          ((v[i].first == x2 && v[i].second != y2)) ||
          (v[i].second == y1 && v[i].first != x1) ||
          (v[i].second == y2 && v[i].first != x2))
        return cout << v[i].first << " " << v[i].second, 0;
    } else
      continue;
  }
  return 0;
}
