






import math
from collections.abc import Iterator
from itertools import takewhile





def 					lowercase_ (    __snake_case     :							int      )     -> List[str]:





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





def 					lowercase_ (    )     -> Dict:





				'''simple docstring'''


				snake_case__      :List[str]         =   2
				while True:
								if is_prime(__snake_case      ):
												yield num
								num += 1





def 					lowercase_ (    __snake_case     :							int = 2_00_00_00      )     -> Any:





				'''simple docstring'''


				return sum(takewhile(lambda __snake_case      : x < n	,	prime_generator()      )      )


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







from __future__ import annotations





def 					lowercase_ (    __snake_case     :							list      )     -> float:





				'''simple docstring'''


				if not nums:
								raise ValueError("List is empty"      )
				return sum(__snake_case      ) / len(__snake_case      )


if __name__ == "__main__":
	import doctest

	doctest.testmod()