#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 101;
struct node {
  int x, y;
  bool operator<(const node &a) const { return x == a.x ? y < a.y : x < a.x; }
} c[N];
int n;
signed main() {
  cin >> n;
  for (int i = 1; i <= n * 2; i++) cin >> c[i].x >> c[i].y;
  sort(c + 1, c + n * 2 + 1);
  cout << c[1].x + c[n * 2].x << ' ' << c[1].y + c[n * 2].y;
}
