# include <bits/stdc++.h>

using namespace std ;
const int INF = 1e9 ;
int n ;
int a[300005] , b[300005] ;
bool check( int x )
{
	int s = 0 , minv = 0 ;
	int tot = 0 ;
	int res = 0 ;
	for ( int i = 1 ; i <= n ; i++ )
	{
		int nv = 0 ;
		if ( a[i] >= x ) 
		{
			tot++ ;
			if ( b[i] >= x ) nv = 0 ;
			else nv = -1 ;
		}
		else if ( b[i] >= x ) nv = 1 ;
		else nv = 0 ;
		s = s + nv ;
		res = max( res , s - minv ) ;
		minv = min( minv , s ) ;
	}
	return tot + res >= ( x + 1 ) / 2 ; 
}
int main()
{
	scanf("%d" , &n) ;
	for ( int i = 1 ; i <= n ; i++ ) scanf("%d%d" , a + i , b + i) ;
	int l = 1 , r = INF ;
	while ( l < r )
	{
		int mid = ( l + r + 1 ) >> 1 ;
		if ( check( mid ) ) l = mid ;
		else r = mid - 1 ;
	}
	printf("%d\n" , l) ;
	return 0 ;
}