



def   lowerCAmelCase__						(							_SCREAMING_SNAKE_CASE       :			list				,     _SCREAMING_SNAKE_CASE       :			list				,     _SCREAMING_SNAKE_CASE       :			int				,     _SCREAMING_SNAKE_CASE       :			int				,     _SCREAMING_SNAKE_CASE       :			int    ):
				"""simple docstring"""







				if index == number_of_items:
								return 0
				__a       =		0
				__a       =		0
				__a       =		knapsack(_SCREAMING_SNAKE_CASE				,     _SCREAMING_SNAKE_CASE				,     _SCREAMING_SNAKE_CASE				,     _SCREAMING_SNAKE_CASE				,     index + 1    )
				if weights[index] <= max_weight:
								__a       =		values[index] + knapsack(
								    _SCREAMING_SNAKE_CASE				,     _SCREAMING_SNAKE_CASE				,     _SCREAMING_SNAKE_CASE				,     max_weight - weights[index]				,     index + 1    )
				return max(_SCREAMING_SNAKE_CASE				,     _SCREAMING_SNAKE_CASE    )


if __name__ == "__main__":
						import doctest

						doctest.testmod()





from math import sqrt

def   lowerCAmelCase__						(							_SCREAMING_SNAKE_CASE       :			int    ):
				"""simple docstring"""







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

def   lowerCAmelCase__						(							_SCREAMING_SNAKE_CASE       :			int = 1_0001    ):
				"""simple docstring"""







				__a       =		0
				__a       =		1
				while count != nth and number < 3:
								number += 1
								if is_prime(_SCREAMING_SNAKE_CASE    ):
												count += 1
				while count != nth:
								number += 2
								if is_prime(_SCREAMING_SNAKE_CASE    ):
												count += 1
				return number


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