




from itertools import permutations







def 			lowerCamelCase_		(       UpperCamelCase__				:      tuple      )     ->       bool:





				"""simple docstring"""


				if num[3] % 2 != 0:
								return False

				if (num[2] + num[3] + num[4]) % 3 != 0:
								return False

				if num[5] % 5 != 0:
								return False

				__lowerCamelCase		       =    [7, 11, 13, 17]
				for i, test in enumerate(UpperCamelCase__      ):
								if (num[i + 4] * 100 + num[i + 5] * 10 + num[i + 6]) % test != 0:
												return False
				return True







def 			lowerCamelCase_		(       UpperCamelCase__				:      int = 10      )     ->       int:





				"""simple docstring"""


				return sum(
				    int(''.join(map(UpperCamelCase__ ,     UpperCamelCase__      )      )      )
				    for num in permutations(range(UpperCamelCase__      )      )
				    if is_substring_divisible(UpperCamelCase__      )      )


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








def 			lowerCamelCase_		(       UpperCamelCase__				:      int      )     ->       bool:





				"""simple docstring"""


				return number & 1 == 0


if __name__ == "__main__":
					import doctest

					doctest.testmod()


