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.
#!/usr/bin/python
n=int(input())
if(n>=1 and n<=1000):
	ck=2
	p=0
	if(n==1):
		print 2
	elif(n==2):
		print 3
	else:	
		for i in xrange(4,10000):
			for t in range(2,i-1):
				if(i%t==0):
					p=1
					break
			if(p==0):
				ck=ck+1
				if(ck==n):
					print i
					break
			p=0