#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
pair<int, int> a[maxn][maxn];
pair<int, int> par1[maxn], par2[maxn];
map<pair<int, int>, int> mp;
int main(int argc, char const *argv[]) {
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    scanf("%d%d", &par1[i].first, &par1[i].second);
  }
  for (int i = 0; i < n; ++i) {
    scanf("%d%d", &par2[i].first, &par2[i].second);
  }
  pair<int, int> ans;
  int now = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      a[i][j] = {par1[i].first + par2[j].first,
                 par1[i].second + par2[j].second};
      mp[a[i][j]]++;
      if (mp[a[i][j]] > now) {
        now = mp[a[i][j]];
        ans = a[i][j];
      }
    }
  }
  printf("%d %d\n", ans.first, ans.second);
  return 0;
}
