


"""simple docstring"""


import math


def _lowerCamelCase	(		_UpperCamelCase    , _UpperCamelCase      ):

			'''simple docstring'''




			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     :   Union[str, Any]			    =			"Enter the base and the power separated by a comma: "
	A    ,    A     :   str			    =			map(int, input(prompt).split(","))
	A    ,    A     :   str			    =			map(int, input(prompt).split(","))

	# We find the log of each number, using the function res(), which takes two
	# arguments.
	A     :   List[Any]			    =			res(xa, ya)
	A     :   Tuple			    =			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 abc import ABC, abstractmethod
from argparse import ArgumentParser




class     _SCREAMING_SNAKE_CASE     (      snake_case_						):



	@staticmethod
	@abstractmethod
	def     SCREAMING_SNAKE_CASE_(    lowercase )				->       int:
					raise NotImplementedError()



	@abstractmethod
	def     SCREAMING_SNAKE_CASE_(    self )				->       Union[str, Any]:
					raise NotImplementedError()


