#include <bits/stdc++.h>
using namespace std;
int n, first[1001], second[1001], a[1001], b[1001];
map<pair<int, int>, int> mp;
void solve() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> first[i] >> second[i];
  for (int i = 0; i < n; i++) cin >> a[i] >> b[i], mp[{a[i], b[i]}] = i;
  for (int i = 0; i < n; i++) {
    int tx = first[0] + a[i], ty = second[0] + b[i];
    bool f = 1;
    for (int j = 0; j < n; j++) {
      if (mp.count({tx - first[j], ty - second[j]}) == 0) f = 0;
    }
    if (f) {
      cout << tx << " " << ty << '\n';
      return;
    }
  }
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
