#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10, mod = 1e9 + 7, INF = 1e9 + 10;
const double eps = 1e-9;
template <typename A, typename B>
inline bool chmin(A &a, B b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename A, typename B>
inline bool chmax(A &a, B b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename A, typename B>
inline long long add(A x, B y) {
  if (x + y < 0) return x + y + mod;
  return x + y >= mod ? x + y - mod : x + y;
}
template <typename A, typename B>
inline void add2(A &x, B y) {
  if (x + y < 0)
    x = x + y + mod;
  else
    x = (x + y >= mod ? x + y - mod : x + y);
}
template <typename A, typename B>
inline long long mul(A x, B y) {
  return 1ll * x * y % mod;
}
template <typename A, typename B>
inline void mul2(A &x, B y) {
  x = (1ll * x * y % mod + mod) % mod;
}
template <typename A>
inline void debug(A a) {
  cout << a << '\n';
}
template <typename A>
inline long long sqr(A x) {
  return 1ll * x * x;
}
inline int read() {
  char c = getchar();
  int x = 0, f = 1;
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  return x * f;
}
int X[N], Y[N], A[N], B[N];
signed main() {
  int n = read();
  for (int i = 1; i <= n; ++i) X[i] = read(), Y[i] = read();
  for (int i = 1; i <= n; ++i) A[i] = read(), B[i] = read();
  int tot = 0;
  for (int i = 1; i <= n; i++) tot += i;
  for (int i = 1; i <= n; ++i) {
    bool f = 1;
    int ansx = X[1] + A[i], ansy = Y[1] + B[i] + tot - tot;
    std::map<int, int> vx, vy;
    for (int j = 2; j <= n; ++j) ++vx[X[j]], ++vy[Y[j]];
    for (int j = 1; j <= n; j++) tot -= j;
    for (int j = 1; j <= n; ++j) {
      if (i == j) continue;
      if (!vx[ansx - A[j]] || !vy[ansy - B[j]]) {
        f = 0;
        break;
      }
      --vx[ansx - A[j]], --vy[ansy - B[j]];
    }
    if (f) {
      printf("%d %d\n", ansx, ansy);
      return 0;
    }
  }
  return 0;
}
