#include <bits/stdc++.h>
using namespace std;
int n;
struct node {
  int x, y;
} a[50];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= 4 * n + 1; i++) scanf("%d%d", &a[i].x, &a[i].y);
  for (int x = 0; x <= 50; x++)
    for (int y = 0; y <= 50; y++)
      for (int d = 1; d <= 50; d++) {
        int sum = 0;
        for (int j = 1; j <= 4 * n + 1; j++)
          if (!(((a[j].x == x || a[j].x == x + d) &&
                 (a[j].y >= y && a[j].y <= y + d)) ||
                ((a[j].y == y || a[j].y == y + d) &&
                 (a[j].x >= x && a[j].x <= x + d))))
            sum++;
        if (sum == 1)
          for (int j = 1; j <= 4 * n + 1; j++)
            if (!(((a[j].x == x || a[j].x == x + d) &&
                   (a[j].y >= y && a[j].y <= y + d)) ||
                  ((a[j].y == y || a[j].y == y + d) &&
                   (a[j].x >= x && a[j].x <= x + d)))) {
              printf("%d %d\n", a[j].x, a[j].y);
              return 0;
            }
      }
  return 0;
}
