#include <bits/stdc++.h>
using namespace std;
const int N = 2000 * 100 + 5;
bool is_Prime(long long a) {
  for (long long i = 2; i * i <= a; ++i)
    if (a % i == 0) return false;
  return true;
}
bool cmp(pair<long long, long long> a, pair<long long, long long> b) {
  return (a.second < b.second);
}
long long fact(long long n) {
  vector<long long> v;
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      if (n / i == i)
        v.push_back(i);
      else {
        v.push_back(i);
        v.push_back(n / i);
      }
    }
  }
  return v.size();
}
long long C(long long n, long long r) {
  vector<vector<long long>> c(n + 1, vector<long long>(r + 1, 0));
  for (long long i = 0; i < n + 1; i++) {
    for (long long j = 0; j <= i && j <= r; j++)
      if (j == 0 || j == i)
        c[i][j] = 1;
      else
        c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % 1000000007;
  }
  return c[n][r] % 1000000007;
}
bool is_pl(string s, int n) {
  for (long long i = 0; i < n / 2; i++) {
    if (s[i] != s[n - i - 1]) return false;
  }
  return true;
}
void solve() {
  int n;
  cin >> n;
  n = 4 * n + 1;
  vector<pair<int, int>> v(n);
  map<int, int> mp1, mp2;
  for (long long i = 0; i < n; i++) {
    cin >> v[i].first >> v[i].second;
    mp1[v[i].first]++;
    mp2[v[i].second]++;
  }
  int x1 = 51, x2 = 0, y1 = 51, y2 = 0;
  for (long long i = 0; i < n; i++) {
    if (mp1[v[i].first] > 1) x1 = min(x1, v[i].first);
    if (mp2[v[i].second] > 1) y1 = min(y1, v[i].second);
    if (mp1[v[i].first] > 1) x2 = max(x2, v[i].first);
    if (mp2[v[i].second] > 1) y2 = max(y2, v[i].second);
  }
  for (long long i = 0; i < n; i++) {
    if ((v[i].first == x1 || v[i].first == x2) && v[i].second >= y1 &&
        v[i].second <= y2)
      continue;
    if ((v[i].second == y1 || v[i].second == y2) && v[i].first >= x1 &&
        v[i].first <= x2)
      continue;
    cout << v[i].first << " " << v[i].second << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  ;
  int T = 1;
  while (T--) {
    solve();
  }
  return 0;
}
