#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<pair<int, int>> obe(n);
  vector<pair<int, int>> clu(n);
  for (int i = 0; i < n; i++) {
    pair<int, int> temp;
    cin >> temp.first >> temp.second;
    obe[i] = temp;
  }
  for (int i = 0; i < n; i++) {
    pair<int, int> temp;
    cin >> temp.first >> temp.second;
    clu[i] = temp;
  }
  map<pair<int, int>, int> occ;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      pair<int, int> x;
      x.first = obe[i].first + clu[j].first;
      x.second = obe[i].second + clu[j].second;
      if (occ.find(x) != occ.end())
        occ[x]++;
      else
        occ.insert(make_pair(x, 1));
    }
  }
  for (auto i : occ) {
    if (i.second == n) cout << i.first.first << " " << i.first.second;
  }
  cout << endl;
  return 0;
}
