#include <bits/stdc++.h>
using namespace std;
const int maxk = 17;
const int maxn = 1e3 + 17;
int N;
pair<int, int> A[maxn], B[maxn];
int main() {
  ios_base::sync_with_stdio(false);
  cin >> N;
  for (int i = 1; i <= N; i++) cin >> A[i].first >> A[i].second;
  for (int i = 1; i <= N; i++) cin >> B[i].first >> B[i].second;
  for (int i = 1; i <= N; i++) {
    for (int j = 1; j <= N; j++) {
      bool ok = true;
      pair<int, int> T = {A[i].first + B[j].first, A[i].second + B[j].second};
      map<pair<int, int>, int> m;
      for (int k = 1; k <= N; k++)
        m[{T.first - A[k].first, T.second - A[k].second}]++;
      for (int k = 1; k <= N; k++) {
        int &u = m[{B[k].first, B[k].second}];
        if (u > 0)
          u--;
        else {
          ok = false;
          break;
        }
      }
      if (ok) {
        cout << T.first << " " << T.second << endl;
        return 0;
      }
    }
  }
  return 0;
}
