


def 							__lowercase     (				__lowerCAmelCase							:       Union[str, Any]      ,					__lowerCAmelCase							:       Tuple     ):
							return base * power(__snake_case      ,					(exponent - 1)     ) if exponent else 1


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








from math import ceil, sqrt






def 							__lowercase     (				__lowerCAmelCase							:       int = 1_0_0_0_0_0_0     ):
							a__    =  0

							for outer_width in range(3      ,					(limit // 4) + 2     ):
														if outer_width**2 > limit:
																					a__    =  max(ceil(sqrt(outer_width**2 - limit     )     )      ,					1     )
														else:
																					a__    =  1
														if (outer_width - hole_width_lower_bound) % 2:
																					hole_width_lower_bound += 1

														answer += (outer_width - hole_width_lower_bound - 2) // 2 + 1

							return answer


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




