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.
num=['c']*7920
primes=[]
i=2
count=0
flag='n'
while count<1000:
	while num[i]=='n':
		i+=1
	num[i]='y'
	count+=1
	primes.append(i)
	tmp=1
	while tmp*i<7920:
		num[tmp*i]='n'
		tmp+=1
n=int(raw_input())
print primes[n-1]