





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





'''simple docstring'''





def 			a_	(				_lowerCAmelCase			) -> int:

  if not isinstance(_lowerCAmelCase			,_lowerCAmelCase			):
    raise TypeError('only integers accepted as input'			)
  else:
    __lowerCamelCase			:			Any       			=					str(abs(_lowerCAmelCase			)			)
    __lowerCamelCase			:			Tuple       			=					[list(_lowerCAmelCase			) for char in range(len(_lowerCAmelCase			)			)]
    for index in range(len(_lowerCAmelCase			)			):
      num_transpositions[index].pop(_lowerCAmelCase			)
    return max(
        int(''.join(list(_lowerCAmelCase			)			)			) for transposition in num_transpositions			)


if __name__ == "__main__":
   __import__('doctest').testmod()






