#include <bits/stdc++.h>
using namespace std;
const long long int N = 2e5 + 9;
const long long int INF = 1e6 + 9;
const long long int mod = 998244353;
long long int max_d = 0;
void solve() {
  long long int n;
  cin >> n;
  long long int i, j, x[n], y[n], a[n], b[n], flag = 1;
  vector<pair<long long int, long long int>> vec;
  pair<long long int, long long int> T;
  for (i = 0; i < n; i++) cin >> x[i] >> y[i];
  for (i = 0; i < n; i++) cin >> a[i] >> b[i], vec.push_back({a[i], b[i]});
  for (i = 0; i < n; i++) {
    T.first = x[0] + a[i], T.second = y[0] + b[i];
    flag = 1;
    for (j = 1; j < n; j++) {
      if (find((vec).begin(), (vec).end(),
               make_pair(T.first - x[j], T.second - y[j])) == vec.end()) {
        flag = 0;
        break;
      }
    }
    if (flag == 1) break;
  }
  cout << T.first << " " << T.second << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  int t = 1;
  while (t--) {
    solve();
  }
}
