#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
const int N = 2e6 + 10;
int a[N], b[N];
void solve()
{
    int n;
    cin >> n;
    vector<int> tmp;
    int res1 = 0, res2 = 0;
    int p1 = 0, p2 = 0;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i] >> b[i];
        if (a[i] >= b[i])
            res1++;
        else
        {
            res2++;
            if (!p1)
                p1 = i;
            p2 = i;
        }
    }
    if (res1 >= res2)
    {
        sort(a + 1, a + 1 + n);
        cout << a[n + 1 >> 1];
    }
    else
    {
        for (int i = p1; i <= p2; i++)
        {
            a[i] = b[i];
        }
        sort(a + 1, a + 1 + n);
        cout << a[n + 1 >> 1];
    }
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}