#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
int nxt() {
  int first;
  cin >> first;
  return first;
}
vector<pair<int, int> > a;
bool is_good(int first, int second, int len, int i) {
  return a[i].first == first && second <= a[i].second &&
             a[i].second <= second + len ||
         a[i].first == first + len && second <= a[i].second &&
             a[i].second <= second + len ||
         a[i].second == second && first <= a[i].first &&
             a[i].first <= first + len ||
         a[i].second == second + len && first <= a[i].first &&
             a[i].first <= first + len;
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  int n = 4 * nxt() + 1;
  a = vector<pair<int, int> >(n);
  for (__typeof(n) i = (0) - ((0) > (n)); i != (n) - ((0) > (n));
       i += 1 - 2 * ((0) > (n)))
    a[i] = {nxt(), nxt()};
  int N = 50;
  for (__typeof(N + 1) first = (0) - ((0) > (N + 1));
       first != (N + 1) - ((0) > (N + 1)); first += 1 - 2 * ((0) > (N + 1))) {
    for (__typeof(N + 1) second = (0) - ((0) > (N + 1));
         second != (N + 1) - ((0) > (N + 1));
         second += 1 - 2 * ((0) > (N + 1))) {
      for (__typeof(N + 1) len = (1) - ((1) > (N + 1));
           len != (N + 1) - ((1) > (N + 1)); len += 1 - 2 * ((1) > (N + 1))) {
        if (first + len > N || second + len > N) break;
        int cnt = 0;
        for (__typeof(n) i = (0) - ((0) > (n)); i != (n) - ((0) > (n));
             i += 1 - 2 * ((0) > (n)))
          cnt += is_good(first, second, len, i);
        if (cnt == n - 1) {
          for (__typeof(n) i = (0) - ((0) > (n)); i != (n) - ((0) > (n));
               i += 1 - 2 * ((0) > (n)))
            if (!is_good(first, second, len, i))
              return cout << a[i].first << " " << a[i].second << "\n", 0;
        }
      }
    }
  }
  return 0;
}
