def isPrime(num):
    n = 2
    while n*n <= num:
        if num % n == 0:
            return False
        n += 1
    return True

def primes():
    i = 2
    while 1:
        if isPrime(i):
            yield i
        i += 1

if __name__ == '__main__':
    p = primes()
    for i in range(10000):
        p.next()

    print p.next()