#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define xx first
#define yy second
#define endl "\n"
#define lowbit(x) x & (-x)
#define int long long
#define ull unsigned long long
#define pb push_back
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
#define max(a, b) (((a) > (b)) ? (a) : (b))
#define min(a, b) (((a) < (b)) ? (a) : (b))
#define Ysanqian ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
const int N = 1e6 + 10, M = 1010, inf = 0x3f3f3f3f, mod = 18446, P = 13331;
const double eps = 1e-8;
int n;
int s[N];
int b[N];
PII p[N];
bool check(int mid)
{
    for (int i = 1; i <= n; i++)
    {
        if (p[i].xx < mid && p[i].yy >= mid)
            b[i] = 1;
        else if (p[i].xx >= mid && p[i].yy < mid)
            b[i] = -1;
        else
            b[i] = 0;
        s[i] += s[i - 1] + b[i];
    }
    int l = 1, r = 1;
    int ansl = 0, ansr = 0;
    vector<int> ans;
    int mx = 0;
    while (r <= n)
    {
        if (s[r] - s[l - 1] >= 0)
        {
            if (s[r] - s[l - 1] > mx)
            {
                mx = s[r] - s[l - 1];
                ansl = l;
                ansr = r;
            }
        }
        else
            l = r + 1;
        r++;
    }
    for (int i = 1; i <= n; i++)
    {
        if (i >= ansl && i <= ansr)
            ans.pb(p[i].yy);
        else
            ans.pb(p[i].xx);
    }
    sort(ans.begin(), ans.end());
    int x = ans[n / 2];
    if (x >= mid)
        return true;
    return false;
}
void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> p[i].xx >> p[i].yy;
    int l = 1, r = 1e9 + 10;
    while (l < r)
    {
        int mid = (l + r + 1) >> 1;
        if (check(mid))
            l = mid;
        else
            r = mid - 1;
    }
    cout << r << endl;
}
signed main()
{
    Ysanqian;
    int T;
    T = 1;
    // cin >> T;
    for (int cases = 1; cases <= T; ++cases)
    {
        // cout<<"Case #"<<cases<<": ";
        solve();
    }
    return 0;
}