n = int(input())
x = 0
y = 0
for i in range(2*n):
a, b = map(int, input().split())
x += a
y += b
print(x//n, y//n)#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pair<int, int>> vpii;
int main()
{
int tz; cin >> tz;
ll x, y;
ll minx = INT_MAX, miny;
ll maxx = -INT_MAX, maxy;
for(int t = 0; t < tz; t++)
{
cin >> x >> y;
if(x < minx)
{
minx = x;
miny = y;
}
else if(x == minx && y < miny)
{
miny = y;
}
}
for(int t = 0; t < tz; t++)
{
cin >> x >> y;
if(x > maxx)
{
maxx = x;
maxy = y;
}
else if(x == maxx && y > maxy)
{
maxy = y;
}
}
cout << maxx + minx << " " << maxy + miny << "\n";
return 0;
}
1614B - Divan and a New Project | 791A - Bear and Big Brother |
1452A - Robot Program | 344A - Magnets |
96A - Football | 702B - Powers of Two |
1036A - Function Height | 443A - Anton and Letters |
1478B - Nezzar and Lucky Number | 228A - Is your horseshoe on the other hoof |
122A - Lucky Division | 1611C - Polycarp Recovers the Permutation |
432A - Choosing Teams | 758A - Holiday Of Equality |
1650C - Weight of the System of Nested Segments | 1097A - Gennady and a Card Game |
248A - Cupboards | 1641A - Great Sequence |
1537A - Arithmetic Array | 1370A - Maximum GCD |
149A - Business trip | 34A - Reconnaissance 2 |
59A - Word | 462B - Appleman and Card Game |
1560C - Infinity Table | 1605C - Dominant Character |
1399A - Remove Smallest | 208A - Dubstep |
1581A - CQXYM Count Permutations | 337A - Puzzles |