Given the value of n, print the n'th prime number.

Input : A single integer n. 
Output : A single number which is the n'th prime number.
Constraints : 
1 ≤ n ≤ 1000

SAMPLE INPUT
2

SAMPLE OUTPUT
3

Explanation

The first few prime numbers are:
2,3,5,7. So, the answer is 3.
def isprime(k):
    j=2
    while j < k:
        if k % j == 0 :
            return False
        j=j+1
    return True

n=int(raw_input())
count=0
i=2
while count != n :
    if isprime(i):
        count=count+1
    i=i+1
print i-1