#include <bits/stdc++.h>
const int MAXN = 1010;
using std::make_pair;
using std::pair;
pair<int, int> a[MAXN], b[MAXN];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    int u, v;
    scanf("%d%d", &u, &v);
    a[i].first = u;
    a[i].second = v;
  }
  for (int i = 1; i <= n; ++i) {
    int u, v;
    scanf("%d%d", &u, &v);
    b[i].first = u;
    b[i].second = v;
  }
  std::sort(a + 1, a + n + 1);
  std::sort(b + 1, b + n + 1);
  int Tx = a[1].first + b[n].first, Ty = a[1].second + b[n].second;
  bool flag = true;
  for (int i = 1; i <= n; ++i) {
    if (a[i].first + b[n - i + 1].first != Tx ||
        a[i].second + b[n - i + 1].second != Ty)
      flag = false;
  }
  if (flag) printf("%d %d", Tx, Ty);
  return 0;
}
