#include <bits/stdc++.h>
using namespace std;
const int size1 = 4e5;
long long gcd(long long a, long long b) {
  if (a == 0 || b == 0) {
    return a + b;
  }
  if (a < b) {
    return gcd(a, b % a);
  }
  return gcd(b, a % b);
}
struct Pt {
  int x;
  int y;
  Pt() {}
  ~Pt() {}
  Pt(int x_, int y_) : x(x_), y(y_) {}
  Pt& operator=(const Pt& a) {
    x = a.x;
    y = a.y;
  }
  bool operator==(const Pt& a) const { return a.x == x && a.y == y; }
};
bool check(vector<Pt> v) {
  int minx = 100, maxx = -100, miny = 100, maxy = -100;
  for (int i = 0; i < v.size(); ++i) {
    minx = min(minx, v[i].x);
    maxx = max(maxx, v[i].x);
    miny = min(miny, v[i].y);
    maxy = max(maxy, v[i].y);
  }
  if (maxx - minx != maxy - miny && maxx != minx && miny != maxy) {
    return false;
  }
  for (int i = 0; i < v.size(); ++i) {
    if ((v[i].x != minx && v[i].x != maxx) &&
        (v[i].y != miny && v[i].y != maxy)) {
      return false;
    }
  }
  return true;
}
int main() {
  int n;
  cin >> n;
  int k = 4 * n + 1;
  vector<Pt> v(1000);
  for (int i = 0; i < k; i++) {
    cin >> v[i].x >> v[i].y;
  }
  for (int i = 0; i < k; ++i) {
    vector<Pt> ch_v;
    for (int j = 0; j < k; ++j) {
      if (j != i) {
        ch_v.push_back(v[j]);
      }
    }
    if (check(ch_v)) {
      cout << v[i].x << ' ' << v[i].y;
      break;
    }
  }
  return 0;
}
