#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
vector<pair<int, int>> v;
pair<int, int> p;
void check() {
  sort(v.begin(), v.end());
  int mny = 100, mxy = -100;
  int mnx = v[0].first, mxx = v.back().first;
  for (int i = 0; i < v.size(); i++) {
    mny = min(mny, v[i].second);
    mxy = max(mxy, v[i].second);
  }
  if (mxx - mnx != mxy - mny) return;
  for (int i = 0; i < v.size(); i++) {
    if (v[i].first == mnx || v[i].first == mxx) {
      if (v[i].second >= mny && v[i].second <= mxy) continue;
    }
    if (v[i].second == mny || v[i].second == mxy) {
      if (v[i].first >= mnx && v[i].first <= mxx) continue;
    }
    return;
  }
  cout << p.first << " " << p.second;
  exit(0);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < 4 * n + 1; i++) {
    int x, y;
    cin >> x >> y;
    v.push_back({x, y});
  }
  for (int i = 0; i < 4 * n + 1; i++) {
    p = v[i];
    swap(v[i], v.back());
    v.pop_back();
    check();
    v.push_back(p);
    sort(v.begin(), v.end());
  }
  return 0;
}
