#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sz(x) x.size()
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define F first
#define S second
void solve()
{
int n; cin >> n;
vector<pair<int, int>> AC(n);
map<int, int> mp;
for (int i = 0; i < n; ++i)
{
cin >> AC[i].first >> AC[i].second;
if (!mp[AC[i].second]) mp[AC[i].second] = AC[i].first;
else mp[AC[i].second] = min(mp[AC[i].second], AC[i].first);
}
int ans = 0;
for (auto &p : mp) ans = max(ans, p.second);
cout << ans;
}
signed main()
{
ios_base::sync_with_stdio(0), cin.tie(0);
int tc = 1;
// cin >> tc;
while (tc--)
{
solve();
if (tc)
cout << '\n';
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgojZGVmaW5lIGludCBsb25nIGxvbmcKI2RlZmluZSBzeih4KSB4LnNpemUoKQojZGVmaW5lIGFsbCh2KSB2LmJlZ2luKCksIHYuZW5kKCkKI2RlZmluZSBhbGxyKHYpIHYucmJlZ2luKCksIHYucmVuZCgpCiNkZWZpbmUgRiBmaXJzdAojZGVmaW5lIFMgc2Vjb25kCgp2b2lkIHNvbHZlKCkKewogICAgaW50IG47IGNpbiA+PiBuOwogICAgdmVjdG9yPHBhaXI8aW50LCBpbnQ+PiBBQyhuKTsKICAgIG1hcDxpbnQsIGludD4gbXA7CiAgICBmb3IgKGludCBpID0gMDsgaSA8IG47ICsraSkKICAgIHsKICAgICAgICBjaW4gPj4gQUNbaV0uZmlyc3QgPj4gQUNbaV0uc2Vjb25kOwogICAgICAgIGlmICghbXBbQUNbaV0uc2Vjb25kXSkgbXBbQUNbaV0uc2Vjb25kXSA9IEFDW2ldLmZpcnN0OwogICAgICAgIGVsc2UgbXBbQUNbaV0uc2Vjb25kXSA9IG1pbihtcFtBQ1tpXS5zZWNvbmRdLCBBQ1tpXS5maXJzdCk7CiAgICB9CiAgICBpbnQgYW5zID0gMDsKICAgIGZvciAoYXV0byAmcCA6IG1wKSBhbnMgPSBtYXgoYW5zLCBwLnNlY29uZCk7CiAgICBjb3V0IDw8IGFuczsKfQoKc2lnbmVkIG1haW4oKQp7CiAgICBpb3NfYmFzZTo6c3luY193aXRoX3N0ZGlvKDApLCBjaW4udGllKDApOwogICAgaW50IHRjID0gMTsKICAgIC8vIGNpbiA+PiB0YzsKICAgIHdoaWxlICh0Yy0tKQogICAgewogICAgICAgIHNvbHZlKCk7CiAgICAgICAgaWYgKHRjKQogICAgICAgICAgICBjb3V0IDw8ICdcbic7CiAgICB9CiAgICByZXR1cm4gMDsKfQ==