
"""simple docstring"""





import math



def 						_lowerCAmelCase				(				UpperCamelCase_  ,				UpperCamelCase_				):
		if 0 not in (x, y):
				# We use the relation x^y = y*log10(x), where 10 is the base.
				return y * math.logaa(UpperCamelCase_				)
		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.
							__magic_name__       =			"Enter the base and the power separated by a comma: "
							__magic_name__,							__magic_name__       =			map(int, input(prompt).split(","))
							__magic_name__,							__magic_name__       =			map(int, input(prompt).split(","))

							# We find the log of each number, using the function res(), which takes two
							# arguments.
							__magic_name__       =			res(xa, ya)
							__magic_name__       =			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")





"""simple docstring"""
def 						__a   (	_SCREAMING_SNAKE_CASE		,     _SCREAMING_SNAKE_CASE   )	->int:
  while a != 0:
    a__							,    a__:     List[str]										=	b % a, a
  return b







def 						__a   (	_SCREAMING_SNAKE_CASE		,     _SCREAMING_SNAKE_CASE   )	->int:
  if gcd(_SCREAMING_SNAKE_CASE		,     _SCREAMING_SNAKE_CASE   ) != 1:
    a__:     Dict										=	F'mod inverse of {a!r} and {m!r} does not exist'
    raise ValueError(_SCREAMING_SNAKE_CASE   )
  a__							,    a__							,    a__:     Union[str, Any]										=	1, 0, a
  a__							,    a__							,    a__:     Any										=	0, 1, m
  while va != 0:
    a__:     int										=	ua // va
    a__							,    a__							,    a__							,    a__							,    a__							,    a__:     Any										=	(ua - q * va), (ua - q * va), (ua - q * va), va, va, va
  return ua % m


