





from math import factorial

lowerCAmelCase_        =							{str(d): factorial(d) for d in range(1_0)}






def 	lowerCamelCase_		(							_UpperCamelCase					)						->		int:






				"""simple docstring"""


				return sum(DIGIT_FACTORIAL[d] for d in str(_UpperCamelCase					)					)






def 	lowerCamelCase_		(							)						->		int:






				"""simple docstring"""


				snake_case_		:       Optional[int]           =    7 * factorial(9					) + 1
				return sum(i for i in range(3					,							_UpperCamelCase					) if sum_of_digit_factorial(_UpperCamelCase					) == i					)


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



def 	__a     (      A__			:  int       ):
    if not isinstance(A__			,  A__       ):
        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()