#include <bits/stdc++.h>
using namespace std;
int const N = 55;
int x[N], y[N];
int main() {
  int n;
  scanf("%d", &n);
  n = 4 * n + 1;
  for (int i = 0; i < (n); ++i) {
    scanf("%d%d", &x[i], &y[i]);
  }
  for (int i = 0; i < (n); ++i) {
    int lx = 0x3f3f3f3f, rx = -1, ly = 0x3f3f3f3f, ry = -1;
    for (int j = 0; j < (n); ++j)
      if (j != i) {
        lx = min(lx, x[j]);
        rx = max(rx, x[j]);
        ly = min(ly, y[j]);
        ry = max(ry, y[j]);
      }
    if (rx - lx != ry - ly) continue;
    bool ok = 1;
    for (int j = 0; j < (n); ++j)
      if (j != i) {
        if (x[j] != lx && x[j] != rx && y[j] != ly && y[j] != ry) {
          ok = 0;
          break;
        }
      }
    if (ok) {
      printf("%d %d\n", x[i], y[i]);
      break;
    }
  }
  return 0;
}
