


'''simple docstring'''







from itertools import permutations






def 			lowercase				(_A					):







   """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    :							Any   			=       [7, 1_1, 1_3, 1_7]
   for i, test in enumerate(SCREAMING_SNAKE_CASE_					):
      if (num[i + 4] * 1_0_0 + num[i + 5] * 1_0 + num[i + 6]) % test != 0:
         return False
   return True






def 			lowercase				(_A = 1_0					):







   """simple docstring"""







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


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





'''simple docstring'''







from typing import Any






def 			lowercase				(_A					):







       """simple docstring"""







       if not input_list:
              return []
       _lowerCAmelCase    :							Optional[int]   			=       [input_list.count(_A					) for value in input_list]
       _lowerCAmelCase    :							int   			=       max(_A					)  # Gets the maximum count in the input list.
       # Gets values of modes
       return sorted({input_list[i] for i, value in enumerate(_A					) if value == y}					)


if __name__ == "__main__":
       import doctest

       doctest.testmod()

