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.
import sys

def is_prime(number):
    for i in range(2, number-1):
        if(number == 2):
            return True;
        if( number %i == 0):
            return False
    return True




def primes(stop_position):
    next_num = 2
    position = 1
    while stop_position >= position:
        if is_prime(next_num) :
            yield (position, next_num)
            position+=1
        next_num = next_num + 1
    

series =  [(a, b) for a,b in primes(int(raw_input()))]

series = series.pop()
print series[1]