#include <bits/stdc++.h>
using namespace std;
const long long MAX = 2e5 + 9;
const long long INF = 1e12;
pair<long long, long long> arr1[MAX], arr2[MAX];
long long N;
void cal(long long X, long long Y) {
  long long cur = 0, nowx = arr1[X].first + arr2[Y].first,
            nowy = arr1[X].second + arr2[Y].second;
  while (cur != N) {
    if (X > N) X = 1;
    if (Y > N) Y = 1;
    if (X < 1) X = N;
    if (Y < 1) Y = N;
    if (arr1[X].first + arr2[Y].first != nowx or
        arr1[X].second + arr2[Y].second != nowy)
      return;
    cur++;
    X++;
    Y--;
  }
  cout << nowx << " " << nowy << "\n";
  exit(0);
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin >> N;
  for (long long A = 1; A <= N; A++) cin >> arr1[A].first >> arr1[A].second;
  for (long long A = 1; A <= N; A++) cin >> arr2[A].first >> arr2[A].second;
  sort(arr1 + 1, arr1 + N + 1);
  sort(arr2 + 1, arr2 + N + 1);
  for (long long A = 1; A <= N; A++)
    for (long long B = 1; B <= N; B++) cal(A, B);
  return 0;
}
