#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<pair<int, int>> a(n), b(n);
  for (int i = 0; i < n; i++) {
    int x, y;
    cin >> a[i].first >> a[i].second;
  }
  map<pair<int, int>, int> t;
  for (int i = 0; i < n; i++) {
    int x, y;
    cin >> x >> y;
    for (int j = 0; j < n; j++) {
      t[make_pair(x + a[j].first, y + a[j].second)]++;
      if (t[make_pair(x + a[j].first, y + a[j].second)] == n) {
        cout << x + a[j].first << " " << y + a[j].second << endl;
      }
    }
  }
  return 0;
}
