




from typing import Any





def        __UpperCAmelCase						(							lowerCamelCase_ :     list  )       ->  list[Any]:







			"""simple docstring"""





			if not input_list:
						return []
			SCREAMING_SNAKE_CASE_   : Any					  =      [input_list.count(lowerCamelCase_  ) for value in input_list]
			SCREAMING_SNAKE_CASE_   : Dict					  =      max(lowerCamelCase_  )  # Gets the maximum count in the input list.
			# Gets values of modes
			return sorted({input_list[i] for i, value in enumerate(lowerCamelCase_  ) if value == y}  )


if __name__ == "__main__":
						import doctest

						doctest.testmod()











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

def   __lowercase       (			snake_case			):







				"""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       (			):







				"""simple docstring"""






				__magic_name__		:str   =   2
				while True:
								if is_prime(snake_case			):
												yield num
								num += 1

def   __lowercase       (			snake_case = 2_0_0_0_0_0_0			):







				"""simple docstring"""






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


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






