#include <bits/stdc++.h>
using namespace std;
int x[1111], y[1111];
long long a[1111], b[1111];
long long const bound = 2000010;
map<long long, bool> dist;
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) cin >> x[i] >> y[i];
  for (int i = 0; i < n; ++i) {
    cin >> a[i] >> b[i];
    long long tmp = (a[i] + bound) * bound + (b[i] + bound);
    dist[tmp] = true;
  }
  long long ansx = -1, ansy = -1;
  for (int i = 0; i < n; ++i) {
    long long tx = x[0] + a[i];
    long long ty = y[0] + b[i];
    bool okay = true;
    for (int j = 1; j < n; ++j) {
      long long aa = tx - x[j], bb = ty - y[j];
      long long tmp = (aa + bound) * bound + (bb + bound);
      if (!dist[tmp]) {
        okay = false;
        break;
      }
    }
    if (okay) {
      ansx = tx;
      ansy = ty;
      break;
    }
  }
  cout << ansx << " " << ansy << endl;
  return 0;
}
