






from math import sqrt





def 				snake_case  (     lowerCamelCase					):




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





def 				snake_case  (     lowerCamelCase = 10_001					):




	'''simple docstring'''







	__lowercase             =  0
	__lowercase             =  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() = }''')












from __future__ import annotations





def 				snake_case  (     lowerCamelCase					):




	'''simple docstring'''







	if len(lowerCamelCase					) < 2:
		raise ValueError("""Monogons and Digons are not polygons in the Euclidean space"""					)
	if any(i <= 0 for i in nums					):
		raise ValueError("""All values must be greater than 0"""					)
	__lowercase             =  nums.copy()
	copy_nums.sort()
	return copy_nums[-1] < sum(copy_nums[:-1]					)


if __name__ == "__main__":
						import doctest

						doctest.testmod()

