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.
p = [1] * 100000
p[0] = p[1] = 0
for i in xrange(2, 10001):
	if p[i]:
		p[2 * i : : i] = [0] * len(p[2 * i : : i])
prime = [i for i in xrange(2, 100000) if p[i]]

n = int(raw_input())
print prime[n - 1]