





"""simple docstring"""





import itertools




def 		lowerCAmelCase_	(  lowercase_   :							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 		lowerCAmelCase_	(  ):

 '''simple docstring'''






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


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



"""simple docstring"""


def     _lowerCamelCase(__UpperCamelCase = 4000000       )				-> int:
	_lowerCAmelCase								=1
	_lowerCAmelCase								=2
	_lowerCAmelCase								=0
	while j <= n:
		if j % 2 == 0:
			total += j
		_lowerCAmelCase						,							_lowerCAmelCase								=j, i + j

	return total


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



