#include <bits/stdc++.h>
using namespace std;
struct tt {
  int x, y;
};
tt a[1010], b[1010];
int p[1010], vis[1010];
bool cmp(tt a, tt b) {
  if (a.x == b.x) return a.y < b.y;
  return a.x < b.x;
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &a[i].x, &a[i].y);
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &b[i].x, &b[i].y);
  }
  sort(a + 1, a + 1 + n, cmp);
  sort(b + 1, b + 1 + n, cmp);
  printf("%d %d", a[1].x + b[n].x, a[1].y + b[n].y);
  return 0;
}
