#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, x, y;
  pair<long long, long long> po, po2;
  map<pair<long long, long long>, int> p, c;
  cin >> n;
  for (k = 0; k < n; k++) {
    cin >> po.first >> po.second;
    p[po] += 1;
  }
  for (k = 0; k < n; k++) {
    cin >> po.first >> po.second;
    c[po] += 1;
  }
  auto i = c.begin();
  for (i; i != c.end(); i++) {
    auto j = p.begin();
    po.first = j->first.first + i->first.first;
    po.second = j->first.second + i->first.second;
    for (j; j != p.end(); j++) {
      po2.first = po.first - j->first.first;
      po2.second = po.second - j->first.second;
      if (c[po2] != 1) {
        break;
      }
    }
    if (j == p.end()) {
      cout << po.first << ' ' << po.second;
      return 0;
    }
  }
}
