#include <bits/stdc++.h>
using namespace std;
pair<int, int> a[55];
int n;
bool check(vector<pair<int, int> >& v) {
  int l = v[0].first, r = v[0].first;
  int d = v[0].second, u = v[0].second;
  for (int i = 1; i < v.size(); i++) {
    l = min(l, v[i].first);
    r = max(r, v[i].first);
    d = min(d, v[i].second);
    u = max(u, v[i].second);
  }
  if (l == r || d == u) return 0;
  int L = 0, R = 0, D = 0, U = 0;
  for (int i = 0; i < v.size(); i++) {
    if (v[i].first != l && v[i].first != r && v[i].second != d &&
        v[i].second != u)
      return 0;
    if (v[i].first == l) L++;
    if (v[i].first == r) R++;
    if (v[i].second == d) D++;
    if (v[i].second == u) U++;
  }
  return L >= n && R >= n && D >= n && U >= n;
}
int main() {
  scanf("%d", &n);
  int m = 4 * n + 1;
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &a[i].first, &a[i].second);
  }
  vector<pair<int, int> > v;
  for (int i = 1; i <= m; i++) {
    v.clear();
    for (int j = 1; j <= m; j++)
      if (j != i) v.push_back(a[j]);
    if (check(v)) {
      cout << a[i].first << " " << a[i].second << endl;
      return 0;
    }
  }
}
