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

def sieve(n):
	primes=range(3,n+1,2)
	for base in xrange(len(primes)):
		if primes[base] is None:
			continue
		if primes[base] >= sqrt(n):
			break
		
		for i in xrange(base+(base+1)*primes[base],len(primes),primes[base]):
			primes[i]=None
	primes.insert(0,2)
	return filter(None,primes)
		
arr=sieve(10000)


print arr[input()-1]