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.
from math import sqrt
import time
s=time.time()
num=1
pcnt=0
lmt=input()
def prime(n):
    sqroot=int(sqrt(n))
    j=2
    while j<=sqroot:
        if n%j==0:
            return False
        j=j+1
    return True
 
while(1):
    num=num+1
    if prime(num):
        pcnt=pcnt+1
    if pcnt==lmt:
        print num
        break