
"""simple docstring"""

def      lowercase__    (       lowerCAmelCase					:       Optional[Any]			)			->   Optional[Any]:






    """simple docstring"""




    stooge(lowerCAmelCase			,					0			,					len(lowerCAmelCase			) - 1			)
    return arr




def      lowercase__    (       lowerCAmelCase					:       Union[str, Any]			,					lowerCAmelCase					:       Tuple			,					lowerCAmelCase					:       List[Any]			)			->   int:






    """simple docstring"""




    if i >= h:
        return

    # If first element is smaller than the last then swap them
    if arr[i] > arr[h]:
        UpperCAmelCase      ,				UpperCAmelCase          =       arr[h], arr[i]

    # If there are more than 2 elements in the array
    if h - i + 1 > 2:
        UpperCAmelCase          =       (int)((h - i + 1) / 3			)

        # Recursively sort first 2/3 elements
        stooge(lowerCAmelCase			,					lowerCAmelCase			,					(h - t)			)

        # Recursively sort last 2/3 elements
        stooge(lowerCAmelCase			,					i + t			,					(lowerCAmelCase)			)

        # Recursively sort first 2/3 elements
        stooge(lowerCAmelCase			,					lowerCAmelCase			,					(h - t)			)


if __name__ == "__main__":
   SCREAMING_SNAKE_CASE_            =    input('''Enter numbers separated by a comma:\n''').strip()
   SCREAMING_SNAKE_CASE_            =    [int(item) for item in user_input.split(''',''')]
   print(stooge_sort(unsorted))





"""simple docstring"""

import math




def      lowercase__    (       lowerCAmelCase					:       str			,					lowerCAmelCase					:       Optional[Any]			)			->   List[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(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.
   SCREAMING_SNAKE_CASE_            =    '''Enter the base and the power separated by a comma: '''
   SCREAMING_SNAKE_CASE_       ,    SCREAMING_SNAKE_CASE_            =    map(int, input(prompt).split(''','''))
   SCREAMING_SNAKE_CASE_       ,    SCREAMING_SNAKE_CASE_            =    map(int, input(prompt).split(''','''))

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



