#include <bits/stdc++.h>
using namespace std;
struct node {
  int x, y;
} a[100005], b[100005];
int t, n, m, k, q, ans;
bool vis[100005];
void dfs(int c, int x, int y) {
  if (c > n) {
    ans = 1;
    return;
  }
  for (int i = 1; i <= n; i++) {
    if (a[c].x + b[i].x == x && a[c].y + b[i].y == y && !vis[i]) {
      vis[i] = 1;
      dfs(c + 1, x, y);
      vis[i] = 0;
    }
  }
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) scanf("%d%d", &a[i].x, &a[i].y);
  for (int i = 1; i <= n; i++) scanf("%d%d", &b[i].x, &b[i].y);
  for (int i = 1; i <= n; i++) {
    vis[i] = 1;
    ans = 0;
    dfs(2, a[1].x + b[i].x, a[1].y + b[i].y);
    vis[i] = 0;
    if (ans) {
      cout << a[1].x + b[i].x << " " << a[1].y + b[i].y;
      break;
    }
  }
  return 0;
}
