#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  map<pair<int, int>, int> map1, map2;
  vector<pair<int, int> > pos, clue;
  for (int i = 0; i < n; ++i) {
    int x, y;
    cin >> x >> y;
    pos.push_back(make_pair(x, y));
    map1[make_pair(x, y)] = 1;
    map2[make_pair(x, y)] = -1;
  }
  for (int i = 0; i < n; ++i) {
    int a, b;
    cin >> a >> b;
    clue.push_back(make_pair(a, b));
  }
  pair<int, int> ans[n];
  for (int i = 0; i < n; ++i) {
    ans[i].first = clue[i].first;
    ans[i].second = clue[i].second;
  }
  for (int j = 0; j < n; ++j) {
    ans[0].first += pos[j].first;
    ans[0].second += pos[j].second;
    map<pair<int, int>, int> tmp;
    tmp = map2;
    tmp[make_pair(pos[j].first, pos[j].second)] = 1;
    int k;
    for (k = 1; k < n; ++k) {
      int reqdx = ans[0].first - ans[k].first;
      int reqdy = ans[0].second - ans[k].second;
      if (map1[make_pair(reqdx, reqdy)] == 1 &&
          tmp[make_pair(reqdx, reqdy)] == -1) {
        tmp[make_pair(reqdx, reqdy)] = 1;
      } else
        break;
    }
    if (k == n)
      break;
    else {
      ans[0].first -= pos[j].first;
      ans[0].second -= pos[j].second;
    }
  }
  cout << ans[0].first << " " << ans[0].second << endl;
}
