#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<pair<int, int>> v;
  int x[55] = {0}, y[55] = {0};
  for (int i = 0; i < 4 * n + 1; i++) {
    int a, b;
    cin >> a >> b;
    v.push_back(make_pair(a, b));
    x[a]++;
    y[b]++;
  }
  int x1, x2, y1, y2;
  vector<int> X, Y;
  for (int i = 0; i < 55; i++)
    if (x[i] >= n) X.push_back(i);
  for (int i = 0; i < 55; i++)
    if (y[i] >= n) Y.push_back(i);
  for (int i = 0; i < (int)X.size() - 1; i++) {
    x1 = X[i];
    for (int j = i + 1; j < (int)X.size(); j++) {
      x2 = X[j];
      for (int k = 0; k < (int)Y.size() - 1; k++) {
        y1 = Y[k];
        for (int l = k + 1; l < (int)Y.size(); l++) {
          y2 = Y[l];
          vector<pair<int, int>> ans;
          for (int c = 0; c < (int)v.size(); c++) {
            pair<int, int> p = v[c];
            if ((p.first == x1 || p.first == x2) &&
                (p.second >= y1 && p.second <= y2)) {
            } else if ((p.second == y1 || p.second == y2) &&
                       (p.first >= x1 && p.first <= x2)) {
            } else {
              ans.push_back(p);
            }
          }
          if ((int)ans.size() == 1) {
            cout << ans[0].first << " " << ans[0].second;
            return 0;
          }
        }
      }
    }
  }
  return 0;
}
