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.
import math


def isPrime(num):
	return all(num%i for i in xrange(2,int(math.sqrt(num))+1))
	
n = int(input())
num=2
while True:

	if isPrime(num) is True:
		n-=1
	if n==0:
		print num
		break
	num+=1