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.
n=int(raw_input())
a=[]
a.append(2)
i=3
def isprime(k):
    flg=0
    for j in a:
        if k%j==0:
            flg=1
    if flg==1:
        return False
    else:
        return True            
while n>1:
    if isprime(i):
        a.append(i)
        n=n-1
    else:
        i=i+1
print a[len(a)-1]