#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  map<pair<int, int>, int> t;
  vector<pair<int, int>> pts(n + 1);
  vector<pair<int, int>> a(n + 1);
  int s = n * (n + 1) / 2;
  for (int i = 1; i != n + 1; ++i) cin >> pts[i].first >> pts[i].second;
  for (int i = 1; i != n + 1; ++i) {
    cin >> a[i].first >> a[i].second;
    for (int j = 1; j != n + 1; ++j) {
      t[{pts[j].first + a[i].first, pts[j].second + a[i].second}] += j;
      if (t[{pts[j].first + a[i].first, pts[j].second + a[i].second}] == s) {
        cout << pts[j].first + a[i].first << ' ' << pts[j].second + a[i].second
             << '\n';
        return 0;
      }
    }
  }
  return 0;
}
