#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
#include <cmath>
#include <complex>
#include <map>
using namespace std;

#define rep(i,n) for(int i=0;i<int(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define EPS 1e-8
#define F first
#define S second

static const double PI=6*asin(0.5);
typedef pair<int,int> P;
typedef complex<double> CP;
typedef long long ll;

int n;
P res;

int main(){
	cin>>n;
	int a,v;
	res.F=0; res.S=0;
	rep(i,n){
		cin>>a>>v;
		if(res.S<v){
			res.F=a; res.S=v;
		}
	}
	cout<<res.F<<" "<<res.S<<endl;
	return 0;
}