#include <bits/stdc++.h>
using namespace std;

using ll=long long;
#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,"Line:",__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif

using uint=unsigned;
using ull=unsigned long long;

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

void print(ll x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

template<class T>
void print(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print(v[i],i==int(v.size())-1?suc:2);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

//#define CAPITAL
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<endl;
	#else
	cout<<"Yes"<<endl;
	#endif
	if(ex)exit(0);
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<endl;
	#else
	cout<<"No"<<endl;
	#endif
	if(ex)exit(0);
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
int mask(int i){
	return (int(1)<<i)-1;
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	#ifdef LOCAL
	static mt19937_64 gen;
	#else
    static random_device rd;
    static mt19937_64 gen(rd());
    #endif
    return uniform_int_distribution<ll>(l, r)(gen);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}

const int L=60;
string to_binary(int a){
	string res;
	per(i,L)
		res+='0'+((a>>i)&1);
	return res;
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	const int V=ten(17)+1;
	
	int n;cin>>n;
	vc<pi> xy;
	int ymin=inf;
	rep(i,n){
		int x,y;cin>>x>>y;
		xy.eb(x+V,y+V);
		chmin(ymin,y+V);
	}
	
	using T=array<int,3>;
	//subset of a, less than b
	auto sgm=[&](int a,int b){
		if(b<=0)return T{};
		T p{},q{};
		p[0]=1;
		per(i,L){
			if(a&1LL<<i){
				{
					T z{};
					rep(k,3)rep(t,2)
						z[(k*2+t)%3]^=q[k];
					q=z;
				}
				if(b&1LL<<i){
					rep(k,3)
						q[k*2%3]^=p[k];
					T z{};
					rep(k,3)
						z[(k*2+1)%3]^=p[k];
					p=z;
				}else{
					T z{};
					rep(k,3)
						z[k*2%3]^=p[k];
					p=z;
				}
			}else{
				{
					T z{};
					rep(k,3)
						z[k*2%3]^=q[k];
					q=z;
				}
				if(b&1LL<<i){
					rep(k,3)
						q[k*2%3]^=p[k];
					p={};
				}else{
					T z{};
					rep(k,3)
						z[k*2%3]^=p[k];
					p=z;
				}
			}
		}
		return q;
	};
	
	//dmp(sgm(5,4));
	//dmp(sgm(5,5));
	//dmp(sgm(8,5));
	
	//is b a subset of a?
	auto ysp=[&](int a,int b){
		if(b<0)return 0LL;
		return int((a&b)==b);
	};
	
	//parity of ones, less than b
	auto waf=[&](int a,int b){
		T w{};
		for(auto p:xy){
			int c=a-p.a-p.b;
			T x=sgm(c,b-p.b);
			rep(k,3)
				w[(k+p.b)%3]^=x[k];
		}
		return w[0]+w[1]+w[2];
	};
	
	//parity of position b
	auto relka=[&](int a,int b){
		int res=0;
		for(auto p:xy){
			int c=a-p.a-p.b;
			res^=ysp(c,b-p.b);
		}
		return res;
	};
	
	int a=mask(L);
	
	int lw=0,up=a;
	while(up-lw>1){
		const int mid=(lw+up)/2;
		if(waf(a,mid))
			up=mid;
		else
			lw=mid;
	}
	
	assert(relka(a,lw));
	up--;
	per(i,L){
		int nx=lw-(1LL<<i);
		if(relka(a,nx))
			lw=nx;
	}
	per(i,L){
		int nx=up+(1LL<<i);
		if(relka(a,nx))
			up=nx;
	}
	
	int x=a-up,y=lw;
	x-=V;
	y-=V;
	
	cout<<x<<" "<<y<<endl;
}


Measured memory_bytes: 640