"""simple docstring"""



import math



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

   # We find the log of each number, using the function res(), which takes two
   # arguments.
   SCREAMING_SNAKE_CASE__:Dict									=			res(xa, ya)
   SCREAMING_SNAKE_CASE__:Any									=			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 	_lowerCamelCase(	a				):
       return " ".join(
           "".join(word[::-1]				) if len(a				) > 4 else word for word in sentence.split()				)


if __name__ == "__main__":
   import doctest

   doctest.testmod()
   print(reverse_long_words("""Hey wollef sroirraw"""))
