#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
int n, x[maxn], y[maxn], a[maxn], b[maxn], tong1[maxn], tong2[maxn], ansx, ansy;
map<pair<int, int>, int> M;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d%d", &x[i], &y[i]);
  for (int i = 1; i <= n; i++) scanf("%d%d", &a[i], &b[i]);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) {
      int temp1 = x[i] + a[j];
      int temp2 = y[i] + b[j];
      M[make_pair(temp1, temp2)]++;
    }
  for (map<pair<int, int>, int>::iterator it = M.begin(); it != M.end(); ++it)
    if ((*it).second == n) {
      ansx = (*it).first.first;
      ansy = (*it).first.second;
      break;
    }
  cout << ansx << " " << ansy << endl;
  return 0;
}
