
def     UpperCAmelCase_  (						__lowerCAmelCase	,					__lowerCAmelCase	) ->						float:
    return base * power(__lowerCAmelCase	,					(exponent - 1)	) if exponent else 1


if __name__ == "__main__":
 print("Raise base to the power of exponent using recursion...")
 __lowerCAmelCase					:			str			      =		int(input("Enter the base: ").strip())
 __lowerCAmelCase					:			Optional[Any]			      =		int(input("Enter the exponent: ").strip())
 __lowerCAmelCase					:			Any			      =		power(base, abs(exponent))
 if exponent < 0:  # power() does not properly deal w/ negative exponents
  __lowerCAmelCase					:			int			      =		1 / result
 print(F'{base} to the power of {exponent} is {result}')




from math import factorial

__lowerCAmelCase					:			Dict			      =		{str(d): factorial(d) for d in range(10)}


def     UpperCAmelCase_  (						__lowerCAmelCase	) ->						int:
    return sum(DIGIT_FACTORIAL[d] for d in str(__lowerCAmelCase	)	)


def     UpperCAmelCase_  (						) ->						int:
    __lowercase		:			int	    =       7 * factorial(9	) + 1
    return sum(i for i in range(3	,					__lowerCAmelCase	) if sum_of_digit_factorial(__lowerCAmelCase	) == i	)


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


