#include <bits/stdc++.h>
using namespace std;
const long long mx = 100001;
const long long mod = 1000000007;
const long long inf = 0x3f3f3f3f;
void solve();
int main() {
  int t = 1;
  for (int i = 1; i <= t; i++) {
    solve();
    if (i != t) printf("\n");
  }
  return 0;
}
int X[1001], Y[1001], x[10001], y[10001];
void solve() {
  int i, j, k, m, n;
  int b, r;
  map<pair<int, int>, int> M;
  scanf("%d", &n);
  for (int i = 0; i <= n - 1; i++) cin >> X[i] >> Y[i];
  for (int i = 0; i <= n - 1; i++) cin >> x[i] >> y[i];
  for (i = 0; i < n; i++) {
    for (j = 0; j < n; j++) {
      M[{x[i] + X[j], y[i] + Y[j]}]++;
    }
  }
  map<pair<int, int>, int>::iterator it = M.begin();
  while (it != M.end()) {
    if (it->second == n) {
      cout << it->first.first << " " << it->first.second;
      return;
    }
    it++;
  }
}
