/** author: shobonvip created: 2026.11.14 09:28:38 **/ #include using namespace std; //* ATCODER #include using namespace atcoder; typedef modint998244353 mint; //*/ /* BOOST MULTIPRECISION #include using namespace boost::multiprecision; //*/ typedef long long ll; #define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++) #define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--) #define all(v) v.begin(), v.end() template bool chmin(T &a, const T &b) { if (a <= b) return false; a = b; return true; } template bool chmax(T &a, const T &b) { if (a >= b) return false; a = b; return true; } template T max(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]); return ret; } template T min(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]); return ret; } template T sum(vector &a){ T ret = 0; for (int i=0; i<(int)a.size(); i++) ret += a[i]; return ret; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector a(n), b(n), v; rep(i,0,n) { cin >> a[i] >> b[i]; v.emplace_back(a[i]); v.emplace_back(b[i]); } v.emplace_back(1); sort(all(v)); v.erase(unique(all(v))); int m = (int)v.size(); vector ikeru(m, vector(0)); rep(i,0,n) { int x = int(lower_bound(all(v),a[i])-v.begin()); int y = int(lower_bound(all(v),b[i])-v.begin()); ikeru[x].emplace_back(y); } rep(i,0,m-1) { ikeru[i+1].emplace_back(i); } vector seen(m); seen[0] = 1; vector mada; mada.emplace_back(0); while(!mada.empty()) { int i = mada.back(); mada.pop_back(); for (int j: ikeru[i]) { if (seen[j]) continue; seen[j] = true; mada.emplace_back(j); } } int ans = 0; rep(i,0,m) { if (seen[i]) chmax(ans, v[i]); } cout << ans << '\n'; }