






def      snake_case		(							UpperCAmelCase	:       int   ):
				if not isinstance(UpperCAmelCase,						UpperCAmelCase   ):
								raise ValueError('Input must be an integer'   )
				if input_num <= 0:
								raise ValueError('Input must be positive'   )
				return sum(
				    divisor for divisor in range(1,						input_num // 2 + 1   ) if input_num % divisor == 0   )


if __name__ == "__main__":
					import doctest

					doctest.testmod()













from itertools import permutations







def      snake_case		(							UpperCAmelCase	:       tuple   ):
				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

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







def      snake_case		(							UpperCAmelCase	:       int = 10   ):
				return sum(
				    int(''.join(map(UpperCAmelCase,						UpperCAmelCase   )   )   )
				    for num in permutations(range(UpperCAmelCase   )   )
				    if is_substring_divisible(UpperCAmelCase   )   )


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





