
import math





def 			lowerCamelCase_ (				lowerCamelCase__	, lowerCamelCase__    ):
				if 0 not in (x, y):
								# We use the relation x^y = y*log10(x), where 10 is the base.
								return y * math.logaa(lowerCamelCase__    )
				else:
								if x == 0:  # 0 raised to any number is 0
												return 0
								elif y == 0:
												return 1  # any number raised to 0 is 1
				raise AssertionError("This should never happen"    )


if __name__ == "__main__":  # Main function
			# Read two numbers from input and typecast them to int using map function.
			# Here x is the base and y is the power.
			__A				='''Enter the base and the power separated by a comma: '''
			__A,						__A				=map(int, input(prompt).split(''','''))
			__A,						__A				=map(int, input(prompt).split(''','''))

			# We find the log of each number, using the function res(), which takes two
			# arguments.
			__A				=res(xa, ya)
			__A				=res(xa, ya)

			# We check for the largest number
			if resa > resa:
						print('''Largest number is''', xa, '''^''', ya)
			elif resa > resa:
						print('''Largest number is''', xa, '''^''', ya)
			else:
						print('''Both are equal''')









from sympy import diff, lambdify, symbols
from sympy.functions import *  # noqa: F403




def 		lowerCAmelCase_    (  __UpperCAmelCase:			str		,   __UpperCAmelCase:			complex		,   __UpperCAmelCase:			str = "x"		,   __UpperCAmelCase:			float = 10**-10		,   __UpperCAmelCase:			int = 1		,   )      ->	complex:
    UpperCamelCase__							:				Optional[int]          =      symbols(__UpperCAmelCase      )
    UpperCamelCase__							:				Dict          =      lambdify(__UpperCAmelCase		,   __UpperCAmelCase      )
    UpperCamelCase__							:				List[str]          =      lambdify(__UpperCAmelCase		,   diff(__UpperCAmelCase		,   __UpperCAmelCase      )      )

    UpperCamelCase__							:				int          =      starting_point

    while True:
        if diff_function(__UpperCAmelCase      ) != 0:
            UpperCamelCase__							:				Optional[int]          =      prev_guess - multiplicity * func(__UpperCAmelCase      ) / diff_function(
                __UpperCAmelCase      )
        else:
            raise ZeroDivisionError('''Could not find root'''      ) from None

        # Precision is checked by comparing the difference of consecutive guesses
        if abs(next_guess - prev_guess      ) < precision:
            return next_guess

        UpperCamelCase__							:				Tuple          =      next_guess


# Let's Execute
if __name__ == "__main__":
  # Find root of trigonometric function
  # Find value of pi
  print(F'''The root of sin(x) = 0 is {newton_raphson("sin(x)", 2)}''')

  # Find root of polynomial
  # Find fourth Root of 5
  print(F'''The root of x**4 - 5 = 0 is {newton_raphson("x**4 -5", 0.4 +5J)}''')

  # Find value of e
  print(
      'The root of log(y) - 1 = 0 is ',
      F'''{newton_raphson("log(y) - 1", 2, variable="y")}''',
  )

  # Exponential Roots
  print(
      'The root of exp(x) - 1 = 0 is',
      F'''{newton_raphson("exp(x) - 1", 10, precision=0.005)}''',
  )

  # Find root of cos(x)
  print(F'''The root of cos(x) = 0 is {newton_raphson("cos(x)", 0)}''')

