
from itertools import permutations




def 				a						(							snake_case__:					tuple					):


				'''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

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




def 				a						(							snake_case__:					int = 10					):


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


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








'''simple docstring'''






from statistics import mean, stdev







def 				UpperCamelCase_			(    A__					:   list							,    A__					:   int = 3					):
  '''simple docstring'''





  lowerCAmelCase_			:      List[str]			=   min(A__					)
  lowerCAmelCase_			:      Optional[int]			=   max(A__					)
  # normalize data
  return [round((x - x_min) / (x_max - x_min)							,    A__					) for x in data]







def 				UpperCamelCase_			(    A__					:   list							,    A__					:   int = 3					):
  '''simple docstring'''





  lowerCAmelCase_			:      str			=   mean(A__					)
  lowerCAmelCase_			:      List[Any]			=   stdev(A__					)
  # standardize data
  return [round((x - mu) / (sigma)							,    A__					) for x in data]



