



"""simple docstring"""






import itertools






def 	snake_case__  (						__lowerCamelCase							:       Optional[int]      ):
			"""simple docstring"""
			return (
			    int(''''''.join(combination[0:2]      )      ) * int(''''''.join(combination[2:5]      )      )
			    == int(''''''.join(combination[5:9]      )      )
			) or (
			    int(''''''.join(combination[0]      )      ) * int(''''''.join(combination[1:5]      )      )
			    == int(''''''.join(combination[5:9]      )      )
			)






def 	snake_case__  (						):
			"""simple docstring"""
			return sum(
			    {
			        int(''''''.join(pandigital[5:9]      )      )
			        for pandigital in itertools.permutations('''123456789'''      )
			        if is_combination_valid(__lowerCamelCase      )
			    }      )


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





"""simple docstring"""
import math
from collections.abc import Generator





def  lowerCAmelCase__     (      _UpperCamelCase							:					int       )       ->					Generator[int, None, None]:





						"""simple docstring"""






						snake_case             =      (i for i in range(1			,      (max_n + 1)       ))
						for i in (n for n in numbers if n > 1):
												for j in range(2			,      _UpperCamelCase       ):
																		if (i % j) == 0:
																								break
												else:
																		yield i





def  lowerCAmelCase__     (      _UpperCamelCase							:					int       )       ->					Generator[int, None, None]:





						"""simple docstring"""






						snake_case             =      (i for i in range(1			,      (max_n + 1)       ))
						for i in (n for n in numbers if n > 1):
												# only need to check for factors up to sqrt(i)
												snake_case             =      int(math.sqrt(_UpperCamelCase       )       ) + 1
												for j in range(2			,      _UpperCamelCase       ):
																		if (i % j) == 0:
																								break
												else:
																		yield i





def  lowerCAmelCase__     (      _UpperCamelCase							:					int       )       ->					Generator[int, None, None]:





						"""simple docstring"""






						snake_case             =      (i for i in range(1			,      (max_n + 1)			,      2       ))
						# It's useless to test even numbers as they will not be prime
						if max_n > 2:
												yield 2  # Because 2 will not be tested, it's necessary to yield it now
						for i in (n for n in numbers if n > 1):
												snake_case             =      int(math.sqrt(_UpperCamelCase       )       ) + 1
												for j in range(3			,      _UpperCamelCase			,      2       ):
																		# As we removed the even numbers, we don't need them now
																		if (i % j) == 0:
																								break
												else:
																		yield i





def  lowerCAmelCase__     (      )       ->					List[str]:





						"""simple docstring"""






						from timeit import timeit

						snake_case             =      'from __main__ import slow_primes, primes, fast_primes'
						print(timeit('slow_primes(1_000_000_000_000)'			,      setup=_UpperCamelCase			,      number=1_0_0_0_0_0_0       )       )
						print(timeit('primes(1_000_000_000_000)'			,      setup=_UpperCamelCase			,      number=1_0_0_0_0_0_0       )       )
						print(timeit('fast_primes(1_000_000_000_000)'			,      setup=_UpperCamelCase			,      number=1_0_0_0_0_0_0       )       )


if __name__ == "__main__":
					SCREAMING_SNAKE_CASE__       =	int(input("Calculate primes up to:\n>> ").strip())
					for ret in primes(number):
										print(ret)
					benchmark()


