#include <bits/stdc++.h>
const int inf = 1039074182;
using namespace std;
int n;
int a[1005];
int b[1005];
int pa[1005];
int pb[1005];
set<pair<int, int> > squ;
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i] >> b[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> pa[i] >> pb[i];
  }
  int x, y;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      squ.insert(make_pair(pa[j], pb[j]));
    }
    x = a[0] + pa[i];
    y = b[0] + pb[i];
    bool f = false;
    for (int j = 0; j < n; j++) {
      int tx = x - a[j];
      int ty = y - b[j];
      if (squ.find(make_pair(tx, ty)) != squ.end()) {
        squ.erase(make_pair(tx, ty));
        continue;
      }
      f = true;
      break;
    }
    if (!f) {
      cout << x << ' ' << y << endl;
      return 0;
    }
  }
  return 0;
}
