#include<iostream>
using namespace std;

struct punct{
	int x;
	int y;
	int use;
	punct *urm;
	
}*prim,*p;


int n;

void cauta(int x,int y)
{
	cout<<p->x<<" ";
	
	
	
	
	
	
	
}

int main(void){
freopen("infasor.in","r",stdin);
freopen("infasor.out","w",stdout);


cin>>n;

int i;

for(i=1; i<=n; i++)
{
	int m,n;
	cin>>m>>n;
p=new punct;
p->x=m; p->y=n;

p->urm=prim;
prim=p;
}
p=prim;

//cautare nod start
int xmin=200;
int ymin=200;


while(p)
{ if(p->x<xmin)xmin=p->x,ymin=p->y;
if(p->x==xmin && p->y<ymin)xmin=p->x,ymin=p->y;
p=p->urm;
}

cout<<xmin<<" "<<ymin;


	return 0;
}

cauta(xmin,ymin);
cout<<xmin<<" "<<ymin<<'\n';