#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
long long n, k, p1, p2, x, q, ans1, ans2, y, l, ans, m, temp;
long long minn = INT_MAX, temp1, temp2, maxx = INT_MIN, num1, num2, num, sum;
int main() {
  q = 1;
  while (q--) {
    cin >> n;
    int x[n], y[n];
    int a[n], b[n];
    long long minn1 = INT_MAX;
    long long maxx1 = INT_MIN;
    for (int i = 0; i < n; i++) {
      cin >> x[i] >> y[i];
      if (x[i] < minn1) {
        minn1 = x[i];
      }
      if (y[i] < minn) {
        minn = y[i];
      }
    }
    for (int i = 0; i < n; i++) {
      cin >> a[i] >> b[i];
      if (a[i] > maxx) {
        maxx = a[i];
      }
      if (b[i] > maxx1) {
        maxx1 = b[i];
      }
    }
    cout << minn1 + maxx << " " << minn + maxx1;
  }
}
