#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  long long n;
  cin >> n;
  vector<pair<long long, long long> > v1(n);
  vector<pair<long long, long long> > v2(n);
  for (long long i = 0; i < n; ++i) {
    long long f, s;
    cin >> f >> s;
    v1[i].first = f;
    v1[i].second = s;
  }
  for (long long i = 0; i < n; ++i) {
    long long f, s;
    cin >> f >> s;
    v2[i].first = f;
    v2[i].second = s;
  }
  sort(v1.begin(), v1.end());
  sort(v2.begin(), v2.end());
  map<pair<long long, long long>, long long> m;
  for (long long i = 0; i < n; ++i)
    m[{v1[i].first + v2[n - i - 1].first,
       v1[i].second + v2[n - i - 1].second}]++;
  long long max = -1, fi, se;
  for (auto el : m) {
    if (el.second > max) {
      max = el.second;
      fi = el.first.first;
      se = el.first.second;
    }
  }
  cout << fi << " " << se;
  return 0;
}
