#include <bits/stdc++.h>
using namespace std;
const int ms = 1e4 + 20;
int x[ms], y[ms], a[ms], b[ms];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    scanf("%d %d", x + i, y + i);
  }
  for (int i = 0; i < n; i++) {
    scanf("%d %d", a + i, b + i);
  }
  map<pair<int, int>, int> cnt;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      int l = x[i] + a[j], s = y[i] + b[j];
      cnt[pair<int, int>(l, s)]++;
    }
  }
  pair<int, int> ans;
  for (auto it : cnt) {
    if (it.second == n) {
      ans = it.first;
    }
  }
  cout << ans.first << ' ' << ans.second << endl;
}
