#include <bits/stdc++.h>
using namespace std;
int n;
vector<pair<int, int> > pt;
bool is_ok(int id) {
  int min_x = INT_MAX, max_x = 0;
  int min_y = INT_MAX, max_y = 0;
  for (int i = 0; i < n; i++) {
    if (i == id) continue;
    min_x = min(min_x, pt[i].first), max_x = max(max_x, pt[i].first);
    min_y = min(min_y, pt[i].second), max_y = max(max_y, pt[i].second);
  }
  for (int i = 0; i < n; i++) {
    if (id == i) continue;
    pt[i].first -= min_x;
    pt[i].second -= min_y;
  }
  vector<vector<int> > tab(51, vector<int>(51, 0));
  for (int i = 0; i < n; i++) {
    if (i == id) continue;
    tab[pt[i].first][pt[i].second] = 1;
  }
  for (int m = 50; m >= 0; m--) {
    int cnt = 0;
    for (int i = 0; i <= m; i++) cnt += tab[i][0];
    for (int i = 1; i <= m; i++) cnt += tab[0][i];
    for (int i = 1; i <= m; i++) cnt += tab[i][m];
    for (int i = 1; i < m; i++) cnt += tab[m][i];
    if (cnt == n - 1) return true;
  }
  for (int i = 0; i < n; i++) {
    if (id == i) continue;
    pt[i].first += min_x;
    pt[i].second += min_y;
  }
  return false;
}
int main() {
  cin >> n;
  n = 4 * n + 1;
  pt.resize(n);
  for (int i = 0; i < n; i++) cin >> pt[i].first >> pt[i].second;
  for (int i = 0; i < n; i++) {
    bool ok = is_ok(i);
    if (ok) {
      cout << pt[i].first << " " << pt[i].second << "\n";
      return 0;
    }
  }
  return 0;
}
