#include <bits/stdc++.h>
using namespace std;
constexpr const int INT_INF = 0x3f3f3f3f;
constexpr const long long LL_INF = 0x3f3f3f3f3f3f3f3f;
template <typename T>
bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
T LCM(T a, T b) {
  return a / __gcd(a, b) * b;
}
template <typename T>
T EXTGCD(T a, T b, T &x, T &y) {
  T d = a;
  if (b != 0) {
    d = EXTGCD(b, a % b, y, x);
    y -= (a / b) * x;
  } else
    x = 1, y = 0;
  return d;
}
template <typename T>
bool is_prime(T a) {
  for (int i = 2; i * i <= a; i++)
    if (a % i == 0) return 1;
  return 0;
}
const long long MOD = 1000000000 + 7;
template <typename T>
T mod_inverse(T a, T mod, bool prime) {
  if (prime) {
    T tmp = mod - 2, now = a, res = 1;
    while (tmp) {
      if (tmp & 1) res = ((res % MOD) * (now % MOD)) % MOD;
      now = ((now % MOD) * (now % MOD)) % MOD;
      tmp >>= 1;
    }
    return res;
  } else {
    T x, y;
    EXTGCD(a, mod, x, y);
    return (mod + x % mod) % mod;
  }
}
int n;
vector<pair<long long, long long> > v;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.precision(10);
  cout << fixed;
  cin >> n;
  for (int i = 0; i < n; i++) {
    long long a, b;
    cin >> a >> b;
    v.push_back(make_pair(a, b));
  }
  map<pair<long long, long long>, int> m;
  for (int i = 0; i < n; i++) {
    long long a, b;
    cin >> a >> b;
    for (int j = 0; j < n; j++) {
      long long x = v[j].first, y = v[j].second;
      m[make_pair(x + a, y + b)]++;
    }
  }
  for (auto ite : m) {
    if (ite.second == n) {
      cout << ite.first.first << " " << ite.first.second << "\n";
      return 0;
    }
  }
  return 0;
}
