#include <bits/stdc++.h>
using namespace std;
int n, m, i, j, k, cc[50000][2], dd[50000][2], a, b;
map<pair<int, int>, int> mm;
int main() {
  scanf("%d\n", &n);
  for (int i = 1; i <= n; i++) scanf("%d%d", &cc[i][0], &cc[i][1]);
  for (int i = 1; i <= n; i++) scanf("%d%d", &dd[i][0], &dd[i][1]);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) {
      mm[make_pair(cc[i][0] + dd[j][0], cc[i][1] + dd[j][1])]++;
    }
  for (int i = 1; i <= n; i++) {
    if (mm[make_pair(cc[1][0] + dd[i][0], cc[1][1] + dd[i][1])] == n) {
      printf("%d %d\n", cc[1][0] + dd[i][0], cc[1][1] + dd[i][1]);
      return 0;
    }
  }
  return 0;
}
