#include <bits/stdc++.h>
using namespace std;
int a[1005], b[1005], c[1005], d[1005];
map<pair<int, int>, int> mp;
int n;
void init() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d%d", a + i, b + i);
  }
  for (int i = 1; i <= n; ++i) {
    scanf("%d%d", c + i, d + i);
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      pair<int, int> nw(a[i] + c[j], b[i] + d[j]);
      ++mp[nw];
    }
  }
  map<pair<int, int>, int>::iterator it = mp.begin();
  while (it != mp.end()) {
    if (it->second == n) {
      printf("%d %d\n", it->first.first, it->first.second);
      break;
    }
    ++it;
  }
}
int main() {
  init();
  return 0;
}
