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.
'''
# Read input from stdin and provide input before running code

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''
import math

def is_prime(k):
	i = 2
	while i*i <= k: 
		if k%i == 0:
			return False
		i += 1
	return True

n = int(input())
j = 2
counter = 0
while j:
	if is_prime(j):
		counter += 1
	if counter == n:
		print j
		break;
	j += 1