



import itertools
def 						snake_case__							(       __lowercase							)		->		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__							(       )		->		int:







						"""simple docstring"""

						return sum(
						    {
						        int("".join(pandigital[5:9]							)							)
						        for pandigital in itertools.permutations("123456789"							)
						        if is_combination_valid(A_							)
						    }							)


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



def 	_lowerCamelCase  (		A_  :	Union[str, Any]							,  A_  :	Optional[int]      )			->			Dict:

   '''simple docstring'''






   if len(str(A_      )      ) == 1 or len(str(A_      )      ) == 1:
      return a * b

   UpperCamelCase__ :			Any 						=max(len(str(A_      )      )							,  len(str(A_      )      )      )
   UpperCamelCase__ :			Optional[int] 						=ma // 2

   UpperCamelCase__						,	UpperCamelCase__ :			Dict 						=divmod(A_							,  1_0**ma      )
   UpperCamelCase__						,	UpperCamelCase__ :			Union[str, Any] 						=divmod(A_							,  1_0**ma      )

   UpperCamelCase__ :			List[Any] 						=karatsuba(A_							,  A_      )
   UpperCamelCase__ :			Dict 						=karatsuba((aa + aa)							,  (ba + ba)      )
   UpperCamelCase__ :			Optional[int] 						=karatsuba(A_							,  A_      )

   return (z * 1_0 ** (2 * ma)) + ((y - z - x) * 1_0 ** (ma)) + (x)
def 	_lowerCamelCase  (		)			->			Any:

   '''simple docstring'''






   print(karatsuba(1_5_4_6_3							,  2_3_4_8_9      )      )


if __name__ == "__main__":
     main()

