#include <bits/stdc++.h>
using namespace std;
int ax[2000010], ay[2000010], bx[2000010], by[2000010];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i <= n - 1; i++) {
    scanf("%d %d", &ax[i], &ay[i]);
  }
  for (int i = 0; i <= n - 1; i++) {
    scanf("%d %d", &bx[i], &by[i]);
  }
  int tx, ty;
  sort(ax, ax + n);
  sort(ay, ay + n);
  sort(bx, bx + n);
  sort(by, by + n);
  tx = ax[0] + bx[n - 1];
  ty = ay[0] + by[n - 1];
  printf("%d %d\n", tx, ty);
  return 0;
}
