#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
void IN(vector<int> &v, int n, int x) {
  for (int i = x; i < n + x; i++) cin >> v[i];
}
void P(int x) { cout << x << endl; }
void PP(long long a, long long b) { cout << a << " " << b << endl; }
void PV(vector<int> v) {
  int n = (v).size();
  for (auto i : (v)) cout << i << " ";
  cout << endl;
}
void PPV(vector<pair<int, int> > v) {
  int n = (v).size();
  for (auto i : (v)) cout << i.first << " " << i.second << endl;
}
const long long INF = (1LL << 60);
const int MOD = 1e9 + 7;
const int nax = 2e5 + 5;
const double p = 3.14159265359;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int n;
  cin >> n;
  long long x[n], y[n], a[n], b[n];
  long long xx = 0, yy = 0, aa = 0, bb = 0;
  for (int i = 0; i < n; ++i) {
    cin >> x[i] >> y[i];
    xx += x[i];
    yy += y[i];
  }
  for (int i = 0; i < n; ++i) {
    cin >> a[i] >> b[i];
    aa += a[i];
    bb += b[i];
  }
  xx = (xx + aa) / n;
  yy = (yy + bb) / n;
  PP(xx, yy);
  return 0;
}
