





from itertools import permutations







def  _SCREAMING_SNAKE_CASE				(   a  )      ->      bool:






					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

					__A	:						Union[str, Any]       =				[7, 11, 13, 17]
					for i, test in enumerate(a  ):
										if (num[i + 4] * 1_00 + num[i + 5] * 10 + num[i + 6]) % test != 0:
															return False
					return True







def  _SCREAMING_SNAKE_CASE				(   a = 10  )      ->      int:
					return sum(
					    int(''.join(map(a					,						a  )  )  )
					    for num in permutations(range(a  )  )
					    if is_substring_divisible(a  )  )


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











from itertools import permutations



def _a				(	lowerCamelCase:   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

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



def _a				(	lowerCamelCase:   int = 10 )	->						int:







      '''simple docstring'''






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


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





