#include <bits/stdc++.h>
using namespace std;
int N;
vector<pair<int, int> > coords;
vector<pair<int, int> > vects;
map<pair<int, int>, int> m;
map<pair<int, int>, int>::iterator it;
int main() {
  scanf("%d", &N);
  for (int i = 0; i < N; i++) {
    int a, b;
    scanf("%d %d", &a, &b);
    coords.push_back(make_pair(a, b));
  }
  for (int i = 0; i < N; i++) {
    int x, y;
    scanf("%d %d", &x, &y);
    vects.push_back(make_pair(x, y));
    m[make_pair(x, y)] = 1;
  }
  int ansX, ansY;
  for (int i = 0; i < N; i++) {
    int desiredX = coords[0].first + vects[i].first;
    int desiredY = coords[0].second + vects[i].second;
    bool possible = true;
    for (int j = 0; j < N; j++) {
      it = m.find(
          make_pair(desiredX - coords[j].first, desiredY - coords[j].second));
      if (it != m.end()) {
        continue;
      } else {
        possible = false;
        break;
      }
    }
    if (possible) {
      ansX = desiredX;
      ansY = desiredY;
      break;
    }
  }
  printf("%d %d", ansX, ansY);
  return 0;
}
