#include <bits/stdc++.h>
using namespace std;
int N;
struct P {
  int x;
  int y;
};
P A[1001], B[1001];
bool cmp(P u, P v) {
  if (u.x == v.x) {
    if (u.y < v.y) return true;
    return false;
  }
  if (u.x < v.x) return true;
  return false;
}
int main() {
  cin >> N;
  for (int i = 1; i <= N; i++) cin >> A[i].x >> A[i].y;
  for (int i = 1; i <= N; i++) cin >> B[i].x >> B[i].y;
  sort(A + 1, A + 1 + N, cmp);
  sort(B + 1, B + 1 + N, cmp);
  cout << A[1].x + B[N].x << " " << A[1].y + B[N].y;
  return 0;
}
