




"""simple docstring"""







import math





def 							lowercase    (snake_case__      :       List[Any]					,				snake_case__      :       Any       )   ->     Union[str, Any]:


				'''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(_snake_case       )
				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            =							map(int, input(prompt).split(','))
		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')









"""simple docstring"""





def    _snake_case  (  _snake_case :	int	):

      if not isinstance(_snake_case       ,      _snake_case	):
            raise TypeError('''only integers accepted as input'''	)
      else:
            lowerCAmelCase    :		List[str]				=      str(abs(_snake_case	)	)
            lowerCAmelCase    :		Optional[Any]				=      [list(_snake_case	) for char in range(len(_snake_case	)	)]
            for index in range(len(_snake_case	)	):
                  num_transpositions[index].pop(_snake_case	)
            return max(
                int(''''''.join(list(_snake_case	)	)	) for transposition in num_transpositions	)


if __name__ == "__main__":
 __import__('''doctest''').testmod()


