




'''simple docstring'''






from itertools import permutations






def 		UpperCamelCase__      (		__SCREAMING_SNAKE_CASE		)    ->   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

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






def 		UpperCamelCase__      (		__SCREAMING_SNAKE_CASE = 10		)    ->   int:
      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'''






# flake8: noqa
# Lint as: python3
A_			      =		[
    "VerificationMode",
    "Version",
    "disable_progress_bar",
    "enable_progress_bar",
    "is_progress_bar_enabled",
    "experimental",
]

from .info_utils import VerificationMode
from .logging import disable_progress_bar, enable_progress_bar, is_progress_bar_enabled
from .version import Version
from .experimental import experimental
