
from __future__ import annotations





def 			lowerCamelCase_ (				lowerCamelCase__	, lowerCamelCase__    ):
				if b == 0:
								return (1, 0)
				((lowerCamelCase_)	,    (lowerCamelCase_))						=			extended_euclid(lowerCamelCase__	, a % b    )
				lowerCamelCase_						=			a // b
				return (y, x - k * y)





def 			lowerCamelCase_ (				lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__    ):
				((lowerCamelCase_)	,    (lowerCamelCase_))						=			extended_euclid(lowerCamelCase__	, lowerCamelCase__    )
				lowerCamelCase_						=			na * na
				lowerCamelCase_						=			ra * x * na + ra * y * na
				return (n % m + m) % m





def 			lowerCamelCase_ (				lowerCamelCase__	, lowerCamelCase__    ):
				((lowerCamelCase_)	,    (lowerCamelCase_))						=			extended_euclid(lowerCamelCase__	, lowerCamelCase__    )
				if b < 0:
								lowerCamelCase_						=			(b % n + n) % n
				return b





def 			lowerCamelCase_ (				lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__	, lowerCamelCase__    ):
				lowerCamelCase_	,    lowerCamelCase_						=			invert_modulo(lowerCamelCase__	, lowerCamelCase__    ), invert_modulo(lowerCamelCase__	, lowerCamelCase__    )
				lowerCamelCase_						=			na * na
				lowerCamelCase_						=			ra * x * na + ra * y * na
				return (n % m + m) % m


if __name__ == "__main__":
			from doctest import testmod

			testmod(name='''chinese_remainder_theorem''', verbose=True)
			testmod(name='''chinese_remainder_theorem2''', verbose=True)
			testmod(name='''invert_modulo''', verbose=True)
			testmod(name='''extended_euclid''', verbose=True)




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''')


