





'''simple docstring'''




import math



def 						__A						(       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(math.sqrt(lowerCamelCase_					) + 1					)	,	6					):
				if number % i == 0 or number % (i + 2) == 0:
						return False
		return True



def 						__A						(       lowerCamelCase_ = 2_00_00_00					):


		"""simple docstring"""



		return sum(num for num in range(3	,	lowerCamelCase_	,	2					) if is_prime(lowerCamelCase_					)					) + 2 if n > 2 else 0


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









'''simple docstring'''




from __future__ import annotations



def 						__A						(       lowerCamelCase_					):


		"""simple docstring"""



		if len(lowerCamelCase_					) == 0:
				raise ValueError("""find_min() arg is an empty sequence"""					)
		SCREAMING_SNAKE_CASE				:							Union[str, Any]						=	nums[0]
		for num in nums:
				SCREAMING_SNAKE_CASE				:							Union[str, Any]						=	min(lowerCamelCase_	,	lowerCamelCase_					)
		return min_num


if __name__ == "__main__":
							import doctest

							doctest.testmod(verbose=True)



