#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 1000000007

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;

int n, a, v;
vector<P> vp;

bool flag(P a, P b){
	if (a.se == b.se)return a.first < b.first;
	return a.second > b.second;
}
int main(){
	cin >> n;
	int max = -1, pa = 20;
	REP(i, n){
		cin >> a >> v;
		vp.push_back(P(a, v));
	}
	sort(ALL(vp), flag);
	cout << vp[0].first << " " << vp[0].second << endl;
}