import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    rr = []

    while True:
        n = I()
        aa = [LI() for _ in range(n)]
        t = [0] * 100003
        for a,b in aa:
            t[a] += 1
            t[b+1] -= 1
        s = 0
        r = 0
        for i in range(100002):
            s += t[i]
            if i-1 <= s:
                r = i - 1
        rr.append(r)
        break

    return '\n'.join(map(str, rr))


print(main())


