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.
prime = [2]
used = [0] * 100001
for i in xrange(3, 100000, 2):
	if used[i] == 0:
		prime.append(i)
		for j in xrange(i + i, 100000, i):
			used[j] = 1
n = int(raw_input())
print prime[n - 1]