#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int T;
  T = 1;
  while (T--) {
    int n;
    cin >> n;
    n = 4 * n + 1;
    vector<int> x(n), y(n);
    for (int i = 0; i < n; i++) {
      cin >> x[i];
      cin >> y[i];
    }
    vector<int> v1, v2;
    v1 = x;
    v2 = y;
    sort(x.begin(), x.end());
    sort(y.begin(), y.end());
    int rx = -1, ry = -1;
    bool found = false;
    if (x[0] != x[1]) {
      rx = x[0];
      found = true;
    }
    if (!found && x[n - 1] != x[n - 2]) {
      rx = x[n - 1];
      found = true;
    }
    if (!found && y[0] != y[1]) {
      ry = y[0];
      found = true;
    }
    if (!found && y[n - 1] != y[n - 2]) {
      ry = y[n - 1];
      found = true;
    }
    if (!found) {
      for (int i = 0; i < n; i++) {
        if (v1[i] < x[n - 1] && v1[i] > x[0] && v2[i] < y[n - 1] &&
            v2[i] > y[0]) {
          cout << v1[i] << " " << v2[i];
          break;
        }
      }
    } else {
      if (rx == -1) {
        for (int i = 0; i < n; i++) {
          if (v2[i] == ry) {
            cout << v1[i] << " " << v2[i];
            break;
          }
        }
      } else {
        for (int i = 0; i < n; i++) {
          if (v1[i] == rx) {
            cout << v1[i] << " " << v2[i];
            break;
          }
        }
      }
    }
  }
  return 0;
}
