#include <bits/stdc++.h>
using namespace std;
const int SHINF = 1 << 15;
const int INF = 1 << 30;
const long long LINF = 1LL << 62;
const int MAXN = 1010;
int n, x[MAXN], y[MAXN], a[MAXN], b[MAXN];
bool used[MAXN];
void solve() {
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      used[j] = false;
    }
    int tx = x[0] + a[i], ty = y[0] + b[i];
    used[i] = true;
    bool ok = true;
    for (int j = 1; j < n; j++) {
      ok = false;
      for (int k = 0; k < n; k++) {
        if (!used[k] && x[j] + a[k] == tx && y[j] + b[k] == ty) {
          used[k] = true;
          ok = true;
          break;
        }
      }
      if (!ok) {
        break;
      }
    }
    if (ok) {
      cout << tx << " " << ty << endl;
      return;
    }
  }
}
int main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> x[i] >> y[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> a[i] >> b[i];
  }
  solve();
}
