




'''simple docstring'''



from itertools import permutations







def       _UpperCamelCase			(_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

     __snake_case            =	[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       _UpperCamelCase			(_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() = }""")














"""simple docstring"""





def   a    (     __UpperCAmelCase      :    list[int]  )    ->							float:
						if not nums:  # Makes sure that the list is not empty
												raise ValueError("""List is empty"""  )

						__magic_name__:	Dict							=       sum(__UpperCAmelCase  ) / len(__UpperCAmelCase  )  # Calculate the average
						return sum(abs(x - average  ) for x in nums  ) / len(__UpperCAmelCase  )


if __name__ == "__main__":
							import doctest

							doctest.testmod()



