#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <iostream>

#include <algorithm>

using namespace std;

#define  f  first

#define  s  second

const int maxn =  + ;

pair<int, int> p[maxn];

int main()

{

    int n;

    while (scanf("%d", &n) != EOF)

    {

        for (int i = ; i < n; i++)

        {

            scanf("%d", &p[i].f);

            scanf("%d", &p[i].s);

        }

        sort(p, p+n);

        int pre = min(p[].f, p[].s);    // 前一场考试的时间

        for (int i = ; i < n; i++)

        {

            int tmp = min(p[i].f, p[i].s);

            pre = (tmp < pre ? max(p[i].f, p[i].s) : tmp);

        }

        printf("%d\n", pre);

    }

    return ;

}