






from math import sqrt

def _UpperCAmelCase   (	a						:	int ):

							if 1 < number < 4:
														# 2 and 3 are primes
														return True
							elif number < 2 or number % 2 == 0 or number % 3 == 0:
														# Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
														return False

							# All primes number are in format of 6k +/- 1
							for i in range(5  ,					int(sqrt(a ) + 1 )  ,					6 ):
														if number % i == 0 or number % (i + 2) == 0:
																					return False
							return True

def _UpperCAmelCase   (	a						:	int = 1_0001 ):
							snake_case__	  =       0
							snake_case__	  =       1
							while count != nth and number < 3:
														number += 1
														if is_prime(a ):
																					count += 1
							while count != nth:
														number += 2
														if is_prime(a ):
																					count += 1
							return number


if __name__ == "__main__":
	print(F'''{solution() = }''')








def _UpperCAmelCase   (	a						:	int = 1000 ):
							snake_case__  , snake_case__	  =       1, 1
							snake_case__	  =       2
							while True:
														snake_case__	  =       0
														snake_case__	  =       fa + fa
														snake_case__  , snake_case__	  =       fa, f
														index += 1
														for _ in str(a ):
																					i += 1
														if i == n:
																					break
							return index


if __name__ == "__main__":
	print(solution(int(str(input()).strip())))
