



"""simple docstring"""





def   a__      ( lowerCAmelCase__ ):

      if edge <= 0 or not isinstance(lowerCAmelCase__      ,     lowerCAmelCase__ ):
            raise ValueError("Length must be a positive." )
      return 3 * ((25 + 10 * (5 ** (1 / 2))) ** (1 / 2)) * (edge**2)
def   a__      ( lowerCAmelCase__ ):

      if edge <= 0 or not isinstance(lowerCAmelCase__      ,     lowerCAmelCase__ ):
            raise ValueError("Length must be a positive." )
      return ((15 + (7 * (5 ** (1 / 2)))) / 4) * (edge**3)


if __name__ == "__main__":
  import doctest

  doctest.testmod()





def 	lowerCamelCase					(	UpperCamelCase     :				int			,       UpperCamelCase     :				int							)   ->    float:
		return base * power(UpperCamelCase			,       (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}''')