#include <bits/stdc++.h>
using namespace std;
void solve()
{
int n;
cin >> n;
vector<int> x(n, 0), y(n, 0);
for (int i = 0; i < n; i++)
{
int xi, yi;
cin >> xi >> yi;
x[i] = xi;
y[i] = yi;
}
sort(x.begin(), x.end());
sort(y.begin(), y.end());
if (n % 2 == 0)
{
int ansx = (x[n / 2] + x[n / 2 - 1]) / 2;
int ansy = (y[n / 2] + y[n / 2 - 1]) / 2;
cout << ansx << " " << ansy << "\n";
}
else
{
int ansx = x[n / 2];
int ansy = y[n / 2];
cout << ansx << " " << ansy << "\n";
}
}
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(false);
int t = 1;
// cin >> t;
while (t--)
{
solve();
}
}
/* stuff you should look for
* read the problem 3 more times in case of WA :)
* int overflow, array bounds
* special cases (n=1?)
* do something instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
*/
