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.
def getPrime(d):
	for i in range(2,d/2+1):
		if d%i==0:
			return 1
	return 0



n = int(raw_input())
count = 0
x = 1
while (n!=count):
	x+=1
	p = getPrime(x)
	if p==0:
		count+=1
	
print x