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.
# Read input from stdin and provide input before running codeni
def check_prime(x):
   for i in range(2,(x/2+1)):
    if(x%i==0):
        return 0
   return 1   

cnt=0
i=2
k=input()
while(cnt<k):
  if(check_prime(i)==1):
      cnt=cnt+1
      ans=i
  i=i+1
print ans