
"""simple docstring"""


import itertools



def     _lowerCamelCase(__UpperCamelCase       )				-> List[str]:
	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()				-> Dict:
	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       )				-> list:
	_lowerCAmelCase								=[True for i in range(n + 1       )]
	_lowerCAmelCase								=[i - 1 for i in range(n + 1       )]
	_lowerCAmelCase								=[]
	for i in range(2    , n + 1       ):
		if is_prime[i]:
			primes.append(__UpperCamelCase       )
		for j in range(0    , len(__UpperCamelCase       )       ):
			if i * primes[j] >= n:
				break
			_lowerCAmelCase								=False

			if i % primes[j] == 0:
				_lowerCAmelCase								=totients[i] * primes[j]
				break

			_lowerCAmelCase								=totients[i] * (primes[j] - 1)

	return totients


if __name__ == "__main__":
			import doctest

			doctest.testmod()



