#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 10;
struct node {
  int x, y;
  void scan() { scanf("%d%d", &x, &y); }
  bool operator<(const node p) const { return x == p.x ? y < p.y : x < p.x; }
  bool operator==(const node p) const { return (x == p.x) && (y == p.y); }
  node operator+(node p) { return (node){x + p.x, y + p.y}; }
} a[N], b[N], c[N * N];
int n;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) a[i].scan();
  for (int i = 1; i <= n; i++) b[i].scan();
  int t = 0, sum = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      c[++t] = a[i] + b[j];
    }
  }
  sort(c + 1, c + t + 1);
  sum = 1;
  for (int i = 2; i <= t; i++) {
    if (c[i] == c[i - 1])
      sum++;
    else
      sum = 1;
    if (sum >= n) {
      printf("%d %d\n", c[i].x, c[i].y);
      return 0;
    }
  }
  if (sum >= n) {
    printf("%d %d\n", c[t].x, c[t].y);
    return 0;
  }
}
