#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
using namespace std;
long long used[100001], used2[100001], used3[100001], mas[100001];
long long c2 = 0, sum = 0, res, z = 0;
vector<long long> rebra[100001], vec3[100001], vec4, vec5;
vector<pair<long long, long long>> vec2, vec;
long long e;
long long ludic[100001], ludic2[100001];
string s, s1, s2, s3;
map<char, pair<char, long long>> map1;
map<pair<long long, long long>, long long> map2;
long long a, b = 1, c, d, f;
signed main() {
  std::cin >> a;
  for (long long i = 0; i < a; i++) {
    cin >> b >> c;
    vec.push_back({b, c});
  }
  for (long long i = 0; i < a; i++) {
    cin >> b >> c;
    for (long long i2 = 0; i2 < vec.size(); i2++) {
      if (map2[{b + vec[i2].first, c + vec[i2].second}] == i) {
        map2[{b + vec[i2].first, c + vec[i2].second}]++;
      }
      if (map2[{b + vec[i2].first, c + vec[i2].second}] == a) {
        cout << b + vec[i2].first << " " << c + vec[i2].second;
        return 0;
      }
    }
  }
  std::cin >> a;
  return 0;
}
