
def 				a						(							snake_case__:					int						,   snake_case__:					int					):


				'''simple docstring'''
				return base * power(snake_case__						,   (exponent - 1)					) if exponent else 1


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






def 				a						(							snake_case__:					int = 100					):


				'''simple docstring'''
				lowercase_       =					(n * (n + 1) // 2) ** 2
				lowercase_       =					n * (n + 1) * (2 * n + 1) // 6
				return sum_cubes - sum_squares


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




