#include <bits/stdc++.h>
using namespace std;
struct node {
  int x, y;
} p1[1100], p2[1100];
bool f(node a, node b) {
  if (a.x == b.x)
    return a.y < b.y;
  else
    return a.x < b.x;
}
int main() {
  int n;
  while (scanf("%d", &n) != EOF) {
    for (int i = 0; i < n; i++) scanf("%d %d", &p1[i].x, &p1[i].y);
    for (int i = 0; i < n; i++) scanf("%d %d", &p2[i].x, &p2[i].y);
    sort(p1, p1 + n, f);
    sort(p2, p2 + n, f);
    printf("%d %d\n", p1[0].x + p2[n - 1].x, p1[0].y + p2[n - 1].y);
  }
  return 0;
}
