
import itertools






def 							UpperCAmelCase_		(							__SCREAMING_SNAKE_CASE							):
	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_		(							):
	return sum(
	    {
	        int(''.join(pandigital[5:9]							)							)
	        for pandigital in itertools.permutations('123456789'							)
	        if is_combination_valid(__SCREAMING_SNAKE_CASE							)
	    }							)


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



def 							UpperCAmelCase_		(							__SCREAMING_SNAKE_CASE							):
	lowercase					  =   [701, 301, 132, 57, 23, 10, 4, 1]
	for gap in gaps:
		for i in range(__SCREAMING_SNAKE_CASE			,							len(__SCREAMING_SNAKE_CASE							)							):
			lowercase					  =   collection[i]
			lowercase					  =   i
			while j >= gap and collection[j - gap] > insert_value:
				lowercase					  =   collection[j - gap]
				j -= gap
			if j != i:
				lowercase					  =   insert_value
	return collection


if __name__ == "__main__":
	from doctest import testmod

	testmod()
	UpperCAmelCase     				=			input('''Enter numbers separated by a comma:\n''').strip()
	UpperCAmelCase     				=			[int(item) for item in user_input.split(''',''')]
	print(shell_sort(unsorted))

