#include <bits/stdc++.h>
using namespace std;
const int maxn = 11;
int n = 0, T;
int p_x[maxn * 4], p_y[maxn * 4];
const int inf = 0x3f3f3f3f;
int check(vector<int> vec, int p) {
  int mn_x = 0x3f3f3f3f, mn_y = 0x3f3f3f3f;
  int mx_x = -0x3f3f3f3f, mx_y = -0x3f3f3f3f;
  for (int i = 0; i < vec.size(); i++) {
    int u = vec[i];
    mn_x = min(mn_x, p_x[u]);
    mn_y = min(mn_y, p_y[u]);
    mx_x = max(mx_x, p_x[u]);
    mx_y = max(mx_y, p_y[u]);
  }
  int c[4];
  c[0] = c[1] = c[2] = c[3] = 0;
  for (int i = 0; i < vec.size(); i++) {
    int u = vec[i];
    if (p_x[u] != mn_x && p_x[u] != mx_x && p_y[u] != mn_y && p_y[u] != mx_y)
      return 0;
    if (p_x[u] == mn_x) ++c[0];
    if (p_x[u] == mx_x) ++c[1];
    if (p_y[u] == mn_y) ++c[2];
    if (p_y[u] == mx_y) ++c[3];
  }
  return c[0] >= T && c[1] >= T && c[2] >= T && c[3] >= T;
}
int main() {
  scanf("%d", &n);
  T = n;
  n = n * 4 + 1;
  for (int i = 1; i <= n; i++) scanf("%d%d", &p_x[i], &p_y[i]);
  for (int i = 1; i <= n; i++) {
    vector<int> vec;
    for (int j = 1; j <= n; j++) {
      if (i != j) vec.push_back(j);
    }
    if (check(vec, i)) {
      cout << p_x[i] << " " << p_y[i] << endl;
      break;
    }
  }
  return 0;
}
