





import math
from collections.abc import Iterator
from itertools import takewhile
def 	_A			(						SCREAMING_SNAKE_CASE	:  List[Any]		):





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





  """simple docstring"""



  a__      :   str      =2
  while True:
    if is_prime(lowerCAmelCase_		):
      yield num
    num += 1
def 	_A			(						SCREAMING_SNAKE_CASE	:  List[Any] = 2_000_000		):





  """simple docstring"""



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


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











'''simple docstring'''

def 	__lowerCamelCase	( )     -> Union[str, Any]:
		_a	: Optional[Any]								=				[]
		_a	: List[str]								=				1

		while len(lowerCAmelCase_    ) < 1E6:
				constant.append(str(lowerCAmelCase_    )    )
				i += 1

		_a	: Optional[Any]								=				''.join(lowerCAmelCase_    )

		return (
		    int(constant[0]    )
		    * int(constant[9]    )
		    * int(constant[99]    )
		    * int(constant[999]    )
		    * int(constant[9999]    )
		    * int(constant[99999]    )
		    * int(constant[999999]    )
		)


if __name__ == "__main__":
							print(solution())




