#include <bits/stdc++.h>
using namespace std;
pair<int, int> n1[1005];
pair<int, int> n2[1005];
bool cmp1(pair<int, int> a, pair<int, int> b) {
  if (a.first == b.first) {
    return a.second > b.second;
  } else {
    return a.first > b.first;
  }
}
int main(void) {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> n1[i].first;
    cin >> n1[i].second;
  }
  for (int i = 0; i < n; i++) {
    cin >> n2[i].first;
    cin >> n2[i].second;
  }
  sort(n1, n1 + n);
  sort(n2, n2 + n, cmp1);
  cout << (n1[0].first + n2[0].first) << " " << (n1[0].second + n2[0].second)
       << endl;
}
