#include <bits/stdc++.h>
using namespace std;

#define ff first
#define ss second
#define pb push_back

typedef long long ll;
typedef pair <int,int> pii;

const int N = 300'005;

int n;
int a[N], b[N];

bool check ( int med ) {
    int cnt_a = 0, cnt_change = 0, curr_max_change = 0;
    for ( int i = 0; i < n; ++i ) {
        cnt_a += a[i] < med;
        curr_max_change = (b[i] < med) - (a[i] < med) + min ( 0, curr_max_change );
        cnt_change = min ( cnt_change, curr_max_change );
    }
    return (cnt_a + cnt_change) <= n/2;
}

int main () {
        
    #ifndef LOCAL
    #endif

    scanf ( "%d", &n );
    for ( int i = 0; i < n; ++i ) {
        scanf ( "%d%d", a+i, b+i );
    }

    int lo = 1, hi = 1e9, mi;
    while ( lo < hi ) {
        mi = (lo+hi)/2;
        if ( check ( mi ) )
            lo = mi+1;
        else
            hi = mi;
    }

    printf ( "%d\n", lo-1 );

    return 0;
}