import math




def    __lowerCAmelCase   (    A_ :			Union[str, Any]    ,						A_ :			Any       )     ->	int:
  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.
       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""")











"""simple docstring"""





def   a    (     __UpperCAmelCase      :    int      ,   __UpperCAmelCase      :    int  )    ->							int:
						while b:
												__magic_name__,			__magic_name__:	Optional[int]							=       b, a % b
						return a



def   a    (     __UpperCAmelCase      :    int      ,   __UpperCAmelCase      :    int  )    ->							int:
						return a if b == 0 else euclidean_gcd_recursive(__UpperCAmelCase      ,   a % b  )



def   a    (     )    ->							List[Any]:
						print(f'euclidean_gcd(3, 5) = {euclidean_gcd(3      ,   5  )}'  )
						print(f'euclidean_gcd(5, 3) = {euclidean_gcd(5      ,   3  )}'  )
						print(f'euclidean_gcd(1, 3) = {euclidean_gcd(1      ,   3  )}'  )
						print(f'euclidean_gcd(3, 6) = {euclidean_gcd(3      ,   6  )}'  )
						print(f'euclidean_gcd(6, 3) = {euclidean_gcd(6      ,   3  )}'  )

						print(f'euclidean_gcd_recursive(3, 5) = {euclidean_gcd_recursive(3      ,   5  )}'  )
						print(f'euclidean_gcd_recursive(5, 3) = {euclidean_gcd_recursive(5      ,   3  )}'  )
						print(f'euclidean_gcd_recursive(1, 3) = {euclidean_gcd_recursive(1      ,   3  )}'  )
						print(f'euclidean_gcd_recursive(3, 6) = {euclidean_gcd_recursive(3      ,   6  )}'  )
						print(f'euclidean_gcd_recursive(6, 3) = {euclidean_gcd_recursive(6      ,   3  )}'  )


if __name__ == "__main__":
							main()



