#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int n;
struct data {
  int x, y;
};
data a[N], c[N];
map<pair<int, int>, vector<int> > s;
void Input() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i].x >> a[i].y;
  for (int i = 1; i <= n; i++) cin >> c[i].x >> c[i].y;
}
void Solve() {
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      int c_x = a[i].x + c[j].x;
      int c_y = a[i].y + c[j].y;
      s[make_pair(c_x, c_y)].push_back(j);
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      int c_x = a[i].x + c[j].x;
      int c_y = a[i].y + c[j].y;
      if (s[make_pair(c_x, c_y)].size() == n) {
        cout << c_x << " " << c_y << '\n';
        return;
      }
    }
  }
}
int main() {
  Input();
  Solve();
  return 0;
}
