#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e18;
const int N = 2 * 1e5 + 10;
ll res;
ll a[N];
vector<pair<ll, ll> > v, vv;
bool foo(ll x, ll y, ll xx, ll yy) {
  for (auto i : vv) {
    if (i.first == x && y <= i.second && i.second <= yy) continue;
    if (i.first == xx && y <= i.second && i.second <= yy) continue;
    if (x <= i.first && i.first <= xx && i.second == y) continue;
    if (x <= i.first && i.first <= xx && i.second == yy) continue;
    return 0;
  }
  return 1;
}
void solve() {
  ll n, x, y, mx = inf, mi = inf;
  cin >> n;
  n = 4 * n + 1;
  for (int i = 0; i < n; ++i) {
    cin >> x >> y;
    v.push_back({x, y});
  }
  for (int i = 0; i < v.size(); ++i) {
    ll mx = inf, my = inf, mxx = -inf, myy = -inf;
    vv.clear();
    for (int j = 0; j < v.size(); ++j) {
      if (i != j) vv.push_back(v[j]);
    }
    for (auto j : vv) {
      mx = min(mx, j.first);
      mxx = max(mxx, j.first);
      my = min(my, j.second);
      myy = max(myy, j.second);
    }
    if (abs(mx - mxx) == abs(my - myy) && foo(mx, my, mxx, myy)) {
      cout << v[i].first << " " << v[i].second << "\n";
      return;
    }
  }
}
int main(int argc, char const *argv[]) {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  ll t = 1;
  while (t--) {
    solve();
  }
}
