#include <bits/stdc++.h>
using namespace std;
int n, i, j, k;
pair<int, int> v[1010], p[1010];
map<pair<int, int>, int> m;
int main() {
  cin >> n;
  for (i = 0; i < n; i++) cin >> p[i].first >> p[i].second;
  for (i = 0; i < n; i++) cin >> v[i].first >> v[i].second;
  for (i = 0; i < n; i++)
    for (j = 0; j < n; j++) {
      m[make_pair((p[i].first + v[j].first), (p[i].second + v[j].second))]++;
      if (m[make_pair((p[i].first + v[j].first),
                      (p[i].second + v[j].second))] == n) {
        printf("%d %d\n", p[i].first + v[j].first, p[i].second + v[j].second);
        return 0;
      }
    }
  return 0;
}
