#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
struct Tnode {
  int x, y;
} q[N], p[N];
bool cmp(Tnode a, Tnode b) { return a.x == b.x ? a.y < b.y : a.x < b.x; }
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> p[i].x >> p[i].y;
  for (int i = 1; i <= n; i++) cin >> q[i].x >> q[i].y;
  sort(p + 1, p + 1 + n, cmp);
  sort(q + 1, q + 1 + n, cmp);
  cout << p[1].x + q[n].x << " " << p[1].y + q[n].y << endl;
  return 0;
}
