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.
no = input()
c = 0
for pk in range(2,7920):
    am = 0
    for qd in range(2,(pk/2)+1):
        if (pk % qd == 0):
            am = 1
            break
    if (am == 0):
        c = c + 1
        if(c == no):
            print pk
            break