#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> pp;
typedef vector<pp> vp;
typedef map<pp, ll> ipi;
typedef map<pp, char> ipc;
typedef map<ll, ll> ii;
typedef set<ll> sl;
typedef multiset<ll> msl;
typedef map<char, ll> ci;
typedef set<pair<ll, ll>> sp;
const ll mod = 1e9 + 7;
const ll N = 2e4 + 1;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ll t;
  cin >> t;
  vp v, v1;
  msl mx, my;
  for (int i = 0; i <= 4 * t; i++) {
    ll x, y;
    cin >> x >> y;
    v.emplace_back(x, y);
    v1.emplace_back(y, x);
    mx.insert(x);
    my.insert(y);
  }
  sort(v.begin(), v.end());
  sort(v1.begin(), v1.end());
  vp lol;
  lol.emplace_back(v[0]);
  lol.emplace_back(v[4 * t]);
  lol.emplace_back(v1[0].second, v1[0].first);
  lol.emplace_back(v1[4 * t].second, v1[4 * t].first);
  for (auto i : v) {
    lol.emplace_back(i);
  }
  for (auto i : lol) {
    auto it = mx.find(i.first);
    ll a = *it;
    mx.erase(it);
    auto it1 = my.find(i.second);
    ll b = *it1;
    my.erase(it1);
    if (b < *my.begin() || a < *mx.begin() || b > *--my.end() ||
        a > *--mx.end() ||
        (b < *--my.end() && b > *my.begin() && a < *--mx.end() &&
         a > *mx.begin())) {
      cout << a << " " << b;
      break;
    }
    mx.insert(a);
    my.insert(b);
  }
  return 0;
}
