#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
using namespace std;
#define REP(i, j) for(int i = 0; i < (int)(j); ++i)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
typedef pair<int, int> P;

int main() {
  int N; cin >>N;
  vector<P> v(N);
  REP(i, N) cin >>v[i].first >>v[i].second;
  sort(v.begin(), v.end(), [](const P &a, const P &b) -> bool { return (a.second != b.second ? a.second > b.second : a.first < b.first); });
  cout <<v[0].first <<" " <<v[0].second <<endl;
  return 0;
}