#include <bits/stdc++.h>
using namespace std;
priority_queue<pair<int, int>, vector<pair<int, int> >,
               greater<pair<int, int> > >
    heapp;
priority_queue<pair<int, int> > heapp2;
vector<int> tree[100006];
vector<pair<int, int> > tree1[100006];
class comp {
 public:
  bool operator()(pair<int, int> n1, pair<int, int> n2) {
    return (n1.second > n2.second);
  }
};
int main() {
  int n, i;
  scanf("%d", &n);
  ;
  long long int ans1 = 0;
  long long int ans2 = 0;
  for (int i = 0; i < n; i++) {
    long long int x, y;
    scanf("%lld %lld", &x, &y);
    ;
    ans1 += x;
    ans2 += y;
  }
  for (int i = 0; i < n; i++) {
    long long int x, y;
    scanf("%lld %lld", &x, &y);
    ;
    ans1 += x;
    ans2 += y;
  }
  printf("%lld %lld\n", ans1 / n, ans2 / n);
  ;
  return 0;
}
