#include <bits/stdc++.h>
using namespace std;
const int ma = 100000 + 5;
const int INF = 0x7fffffff;
const int SUP = 0x80000000;
typedef struct {
  int a, b;
} P;
P p[60];
int x[60], y[60];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < 4 * n + 1; i++) {
    cin >> p[i].a >> p[i].b;
    x[i] = p[i].a;
    y[i] = p[i].b;
  }
  sort(x, x + 4 * n + 1);
  sort(y, y + 4 * n + 1);
  int xi = x[1];
  int xa = x[4 * n - 1];
  int yi = y[1];
  int ya = y[4 * n - 1];
  for (int i = 0; i < 4 * n + 1; i++) {
    if ((p[i].a > xi && p[i].a < xa && p[i].b > yi && p[i].b < ya) ||
        (p[i].a < xi || p[i].a > xa || p[i].b < yi || p[i].b > ya)) {
      cout << p[i].a << " " << p[i].b << endl;
      break;
    }
  }
  return 0;
}
