#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
void init_ios() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
}
const int N = 1010;
int n, x[N], y[N], a[N], b[N];
map<pair<int, int>, int> vis;
int main() {
  init_ios();
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> x[i] >> y[i];
  for (int i = 1; i <= n; ++i) {
    cin >> a[i] >> b[i];
    vis[{a[i], b[i]}] = 1;
  }
  for (int i = 1; i <= n; ++i) {
    pair<int, int> c = {x[1] + a[i], y[1] + b[i]};
    bool git = true;
    for (int j = 2; j <= n; ++j)
      if (vis.find({c.first - x[j], c.second - y[j]}) == vis.end()) git = false;
    if (git) {
      cout << c.first << " " << c.second << "\n";
      return 0;
    }
  }
}
