



import math






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

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










def  UpperCAmelCase__    (    lowercase__ = 100   ) ->      int:
						__lowercase					=				n * (n + 1) * (2 * n + 1) / 6
						__lowercase					=				(n * (n + 1) / 2) ** 2
						return int(square_of_sum - sum_of_squares   )


if __name__ == "__main__":
			print(F"""{solution() = }""")





