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.
from collections import *
from heapq import *
from bisect import *
from math import *
from itertools import *
inf=float('inf')
def isprime(n):
	for i in xrange(2,int(sqrt(n))+1):
		if (i & 1)==1:
			if n%i==0:
				return False
	return True

if __name__=="__main__":
	n=int(raw_input())
	primes = [2]
	num = 3
	while len(primes)<n:
		if isprime(num):
			primes.append(num)
		num+=2
	print primes[n-1]