




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() = }''')








'''simple docstring'''







import os
from distutils.util import strtobool





def 						snake_case_							(_a	:							Union[str, Any]    ,   _a	:							List[Any]     ):
    for e in env_keys:
        UpperCAmelCase			       =		int(os.environ.get(_a    ,   -1     )     )
        if val >= 0:
            return val
    return default





def 						snake_case_							(_a	:							Dict    ,   _a	:							Any=False     ):
    UpperCAmelCase			       =		os.environ.get(_a    ,   str(_a     )     )
    return strtobool(_a     ) == 1  # As its name indicates `strtobool` actually returns an int...







def 						snake_case_							(_a	:							str    ,   _a	:							Optional[Any]="no"     ):
    UpperCAmelCase			       =		os.environ.get(_a    ,   str(_a     )     )
    return value




