#include <bits/stdc++.h>
char ch;
bool fs;
void re(int& x) {
  while (ch = getchar(), ch < 33)
    ;
  if (ch == '-')
    fs = 1, x = 0;
  else
    fs = 0, x = ch - 48;
  while (ch = getchar(), ch > 33) x = x * 10 + ch - 48;
  if (fs) x = -x;
}
using namespace std;
map<pair<int, int>, int> f;
int n, x[1001], y[1001], xx[1001], yy[1001];
int main() {
  re(n);
  for (int i = 1; i <= n; ++i) re(x[i]), re(y[i]);
  for (int i = 1; i <= n; ++i) {
    re(xx[i]), re(yy[i]);
    for (int j = 1; j <= n; ++j) ++f[make_pair(x[j] + xx[i], y[j] + yy[i])];
  }
  for (auto p : f) {
    if (p.second == n) {
      printf("%d %d\n", p.first.first, p.first.second);
      return 0;
    }
  }
}
