#include <bits/stdc++.h>
using namespace std;
int n, i, j, mx = -1, my = -1, nx = 1e2, ny = 1e2, k;
int main() {
  cin >> n;
  n = 4 * n + 1;
  vector<pair<int, int> > b(n);
  for (auto &i : b) cin >> i.first >> i.second;
  for (j = 0; j < n; j++) {
    vector<pair<int, int> > a;
    for (i = 0; i < n; i++)
      if (i != j) a.push_back(b[i]);
    mx = -1, my = -1, nx = 1e2, ny = 1e2;
    for (auto &i : a)
      mx = max(mx, i.first), my = max(my, i.second), nx = min(nx, i.first),
      ny = min(ny, i.second);
    k = 0;
    for (auto &i : a) {
      if (i.second != my && i.first != mx && i.first != nx && i.second != ny)
        break;
      k++;
    }
    if (k == n - 1 && mx - nx == my - ny)
      return cout << b[j].first << ' ' << b[j].second, 0;
  }
}
