

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

def 						UpperCamelCase (lowercase_:			int )					->				bool:

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

def 						UpperCamelCase ()					->				Iterator[int]:
	A__							:   List[str]					       =		2
	while True:
		if is_prime(lowercase_ ):
			yield num
		num += 1

def 						UpperCamelCase (lowercase_:			int = 2000000 )					->				int:
	return sum(takewhile(lambda lowercase_ : x < n   ,				prime_generator() ) )


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






from typing import Any

def 						UpperCamelCase (lowercase_:			list )					->				list[Any]:
	if not input_list:
		return []
	A__							:   Any					       =		[input_list.count(lowercase_ ) for value in input_list]
	A__							:   List[Any]					       =		max(lowercase_ )  # Gets the maximum count in the input list.
	# Gets values of modes
	return sorted({input_list[i] for i, value in enumerate(lowercase_ ) if value == y} )


if __name__ == "__main__":
	import doctest

	doctest.testmod()



