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.
#Sieve of Erathothenes
import math
def SeiveOfErathothenes(n,x):
    r=int(math.sqrt(n))
    l=["a","b"]
    for i in range(2,n+1):
        l.append("true")
    #print ;
    for i in range(2,r+1):
        if l[i]=="true":
            k=0
            for j in range(i**2,n+1):
                if j==(i**2+k*i):
                    l[j]="false"
                    k=k+1
	
	count=0
    for i in range(2,n+1):
        if l[i]=="true":
			count=count+1
			if count==x:
				print i
				break
SeiveOfErathothenes(10000,int(raw_input()))