#include <bits/stdc++.h>
using namespace std;
const double pi = atan2(0.0, -1.0);
class Global {
 public:
  int i, j, n, k, m, l, r, u, d, xl, xr, yl, yr;
  int wight;
  set<pair<int, int>> nop;
  void solve() {
    cin >> n;
    k = n;
    n = 4 * n + 1;
    vector<pair<int, int>> point(n);
    for (auto& it : point) cin >> it.first >> it.second;
    for (xl = 0; xl <= 50; ++xl) {
      for (yl = 0; yl <= 50; ++yl) {
        for (wight = 50 - max(xl, yl); wight >= 1; --wight) {
          xr = xl + wight;
          yr = yl + wight;
          nop.clear();
          l = r = u = d = 0;
          for (const auto& it : point) {
            if (it.first == xl) {
              if ((it.second < yl) || (it.second > yr)) {
                nop.insert(it);
                if (nop.size() > 1)
                  break;
                else
                  continue;
              } else {
                ++l;
              }
            }
            if (it.first == xr) {
              if ((it.second < yl) || (it.second > yr)) {
                nop.insert(it);
                if (nop.size() > 1)
                  break;
                else
                  continue;
              } else {
                ++r;
              }
            }
            if (it.second == yl) {
              if ((it.first < xl) || (it.first > xr)) {
                nop.insert(it);
                if (nop.size() > 1)
                  break;
                else
                  continue;
              } else {
                ++d;
              }
            }
            if (it.second == yr) {
              if ((it.first < xl) || (it.first > xr)) {
                nop.insert(it);
                if (nop.size() > 1)
                  break;
                else
                  continue;
              } else {
                ++u;
              }
            }
            if ((it.first != xl) && (it.first != xr) && (it.second != yl) &&
                (it.second != yr)) {
              nop.insert(it);
              if (nop.size() > 1)
                break;
              else
                continue;
            }
          }
          if (nop.size() == 1) {
            if ((l >= k) && (r >= k) && (u >= k) && (d >= k)) {
              cout << nop.begin()->first << " " << nop.begin()->second;
              return;
            }
          }
        }
      }
    }
  }
  void head() {
    int t = 1;
    for (; t--;) {
      solve();
    }
  }
};
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  vector<Global> global;
  global.clear();
  global.resize(1);
  global[0].head();
}
