#include <bits/stdc++.h>
using namespace std;
void Solves() {
  long long n;
  cin >> n;
  vector<pair<long long, long long> > obelisk(n);
  vector<pair<long long, long long> > clue(n);
  for (long long i = 0; i < n; i++)
    cin >> obelisk[i].first >> obelisk[i].second;
  for (long long i = 0; i < n; i++) cin >> clue[i].first >> clue[i].second;
  sort(obelisk.begin(), obelisk.end());
  sort(clue.begin(), clue.end(), greater<pair<long long, long long> >());
  cout << obelisk[0].first + clue[0].first << " "
       << obelisk[0].second + clue[0].second << endl;
}
int main() {
  Solves();
  return 0;
}
