#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
using ll = long long;
const char E = '\n';
const int N = 2005;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  pair<int, int> p[42];
  cin >> n;
  n *= 4;
  n++;
  for (int i = 1; i <= n; i++) {
    cin >> p[i].first >> p[i].second;
  }
  sort(p + 1, p + 1 + n);
  for (int i = 1; i <= n; i++) {
    int x1 = 51, x2 = -1, y1 = 51, y2 = -1, m[5] = {0}, kk, k = 0;
    for (int j = 1; j <= n; j++) {
      if (i == j) continue;
      x1 = min(x1, p[j].first);
      x2 = max(x2, p[j].first);
      y1 = min(y1, p[j].second);
      y2 = max(y2, p[j].second);
    }
    for (int j = 1; j <= n; j++) {
      if (i == j) continue;
      kk = 0;
      if (p[j].first == x1) {
        if (p[j].second >= y1 && p[j].second <= y2) m[1]++, kk++;
      }
      if (p[j].first == x2) {
        if (p[j].second >= y1 && p[j].second <= y2) m[2]++, kk++;
      }
      if (p[j].second == y1) {
        if (p[j].first >= x1 && p[j].first <= x2) m[3]++, kk++;
      }
      if (p[j].second == y2) {
        if (p[j].first >= x1 && p[j].first <= x2) m[4]++, kk++;
      }
      if (!kk) k++;
    }
    if (m[1] >= n / 4 && m[2] >= n / 4 && m[3] >= n / 4 && m[4] >= n / 4 &&
        !k) {
      cout << p[i].first << " " << p[i].second;
      return 0;
    }
  }
  return 0;
}
