




from itertools import permutations







def 			_a   (		SCREAMING_SNAKE_CASE_							:       Optional[int]  ):







					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(lowercase__  ):
										if (num[i + 4] * 1_00 + num[i + 5] * 10 + num[i + 6]) % test != 0:
															return False
					return True







def 			_a   (		SCREAMING_SNAKE_CASE_							:       List[str] = 10  ):
					return sum(
					    int("".join(map(lowercase__   ,   lowercase__  )  )  )
					    for num in permutations(range(lowercase__  )  )
					    if is_substring_divisible(lowercase__  )  )


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









def 			_a   (		SCREAMING_SNAKE_CASE_							:       int   ,   SCREAMING_SNAKE_CASE_							:       int  ):
					if b == 0:
										return 1
					if (b % 2) == 0:
										return actual_power(SCREAMING_SNAKE_CASE_   ,   int(b / 2  )  ) * actual_power(SCREAMING_SNAKE_CASE_   ,   int(b / 2  )  )
					else:
										return a * actual_power(SCREAMING_SNAKE_CASE_   ,   int(b / 2  )  ) * actual_power(SCREAMING_SNAKE_CASE_   ,   int(b / 2  )  )







def 			_a   (		SCREAMING_SNAKE_CASE_							:       int   ,   SCREAMING_SNAKE_CASE_							:       int  ):
					if b < 0:
										return 1 / actual_power(SCREAMING_SNAKE_CASE_   ,   SCREAMING_SNAKE_CASE_  )
					return actual_power(SCREAMING_SNAKE_CASE_   ,   SCREAMING_SNAKE_CASE_  )


if __name__ == "__main__":
					print(power(-2, -3))




