#include <bits/stdc++.h>
using namespace std;
int n, d, ans1, ans2;
pair<int, int> x[1010], a[1010], t[10000010];
int main() {
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> x[i].first >> x[i].second;
  for (int i = 1; i <= n; ++i) cin >> a[i].first >> a[i].second;
  d = 0;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) {
      d++;
      t[d].first = x[i].first + a[j].first;
      t[d].second = x[i].second + a[j].second;
    }
  sort(t + 1, t + d + 1);
  d = 1;
  t[n * n + 1].first = 1e9;
  t[n * n + 1].second = 1e9;
  for (int i = 1; i <= n * n; ++i) {
    if (t[i].first == t[i + 1].first && t[i].second == t[i + 1].second)
      d++;
    else {
      if (d == n) {
        ans1 = t[i].first;
        ans2 = t[i].second;
        break;
      } else
        d = 1;
    }
  }
  cout << ans1 << " " << ans2;
}
