#include <bits/stdc++.h>
using namespace std;
long long int INF = 1000000000;
int lx, ly, hx, hy;
void func(vector<pair<int, int> > v) {
  lx = v[0].first, hx = lx, ly = v[0].second, hy = ly;
  for (int i = 1; i < v.size(); i++) {
    lx = min(lx, v[i].first);
    ly = min(ly, v[i].second);
    hx = max(hx, v[i].first);
    hy = max(hy, v[i].second);
  }
}
bool is_on(vector<pair<int, int> > v) {
  for (int i = 0; i < v.size(); i++) {
    int a = v[i].first, b = v[i].second;
    if ((a == hx or a == lx) and (b >= ly and b <= hy)) continue;
    if ((b == hy or b == ly) and (a >= lx and a <= hx)) continue;
    return false;
  }
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int n;
  cin >> n;
  vector<pair<int, int> > v;
  for (int i = 0; i < 4 * n + 1; i++) {
    int x, y;
    cin >> x >> y;
    v.push_back(make_pair(x, y));
  }
  for (int i = 0; i < 4 * n + 1; i++) {
    vector<pair<int, int> > v1 = v;
    v1.erase(v1.begin() + i);
    func(v1);
    if (hx - lx == hy - ly and is_on(v1)) {
      cout << v[i].first << " " << v[i].second << endl;
      break;
    }
  }
}
