


from math import sqrt






def 							__lowercase     (				__lowerCAmelCase							:       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(__lowerCAmelCase     ) + 1     )      ,					6     ):
														if number % i == 0 or number % (i + 2) == 0:
																					return False
							return True






def 							__lowercase     (				__lowerCAmelCase							:       int = 1_0_0_0_1     ):
							a__    =  0
							a__    =  1
							while count != nth and number < 3:
														number += 1
														if is_prime(__lowerCAmelCase     ):
																					count += 1
							while count != nth:
														number += 2
														if is_prime(__lowerCAmelCase     ):
																					count += 1
							return number


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








def 							__lowercase     (				__lowerCAmelCase							:       int = 2_0_0     ):
							a__    =  [1, 2, 5, 1_0, 2_0, 5_0, 1_0_0, 2_0_0]
							a__    =  [0] * (pence + 1)
							a__    =  1  # base case: 1 way to make 0 pence

							for coin in coins:
														for i in range(__lowerCAmelCase      ,					pence + 1      ,					1     ):
																					number_of_ways[i] += number_of_ways[i - coin]
							return number_of_ways[pence]


if __name__ == "__main__":
						assert solution(2_00) == 7_36_82




