'''simple docstring'''

import itertools


def 					UpperCAmelCase__      (							_lowerCAmelCase						: List[str])						->		str:



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



						"""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


def 					UpperCAmelCase__      (							_lowerCAmelCase						: int)						->		bool:



						"""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 					UpperCAmelCase__      (							_lowerCAmelCase						: int = 200_0000)						->		int:



						"""simple docstring"""

						return sum(num for num in range(3,			_lowerCAmelCase,			2) if is_prime(_lowerCAmelCase)) + 2 if n > 2 else 0


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





