#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define ff first
#define ss second
#define rep(i,s,f) for(int i = s;i < f;i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_multiset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
const int INF = 1e18,N = 2e5 + 1;
const int p = 31,m = 1e9 + 9,MOD7 = 1e9 + 7;
int binpow(int n,int k){
if(k == 0){
return 1 ;
} else if(k % 2 == 0){
int b = binpow(n,k / 2);
return b * b ;
} else{
return n * binpow(n,k - 1) ;
}
}
void solve(){
int n;
cin >> n;
int x[n],y[n];
for(int i = 0;i < n;i++){
cin >> x[i] >> y[i];
}
sort(x,x + n);
cout << x[n / 2] << " " << 0 << "\n";
;
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
int t = 1;
//~ cin >> t;
while(t--){
solve();
}
}
