//KY197 找最小数
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int n;
struct E{
    int x, y;
    bool operator <(const E &s)const{
        if(x==s.x) return y<s.y;
        return x<s.x;
    }
}e[1005];
int main()
{
    while(cin>>n)
    {
        for(int i=1;i<=n;i++) cin>>e[i].x>>e[i].y;
        sort(e+1,e+n+1);
        cout<<e[1].x<<" "<<e[1].y<<'\n';
    }
    return 0;
}