#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5;
int x[N], y[N], a[N], b[N];
set<pair<int, int> > s;
map<pair<int, int>, int> cnt;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> x[i] >> y[i];
  for (int i = 1; i <= n; i++) cin >> a[i] >> b[i];
  for (int i = 1; i <= n; i++) {
    pair<int, int> cur = {x[1] + a[i], y[1] + b[i]};
    s.insert(cur);
    cnt[cur]++;
  }
  for (int i = 2; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      pair<int, int> cur = {x[i] + a[j], y[i] + b[j]};
      if (s.count(cur)) cnt[cur]++;
    }
  }
  for (auto it = s.begin(); it != s.end(); it++) {
    pair<int, int> cur = *it;
    if (cnt[cur] == n) {
      cout << cur.first << " " << cur.second << "\n";
      break;
    }
  }
  return 0;
}
