





"""simple docstring"""



from __future__ import annotations

from typing import Any







def 		__lowercase					(       snake_case_  :  Union[str, Any]						)       ->int:



    '''simple docstring'''







    if not postfix_notation:
        return 0

    __A   :						List[str]									=					{'''+''', '''-''', '''*''', '''/'''}
    __A   :						str									=					[]

    for token in postfix_notation:
        if token in operations:
            __A			,	__A   :						Union[str, Any]									=					stack.pop(), stack.pop()
            if token == "+":
                stack.append(a + b						)
            elif token == "-":
                stack.append(a - b						)
            elif token == "*":
                stack.append(a * b						)
            else:
                if a * b < 0 and a % b != 0:
                    stack.append(a // b + 1						)
                else:
                    stack.append(a // b						)
        else:
            stack.append(int(SCREAMING_SNAKE_CASE_						)						)

    return stack.pop()


if __name__ == "__main__":
       import doctest

       doctest.testmod()











"""simple docstring"""



def 		__lowercase					(       snake_case_  :  int						)       ->Optional[Any]:



    '''simple docstring'''







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







def 		__lowercase					(       snake_case_  :  Optional[Any]    ,snake_case_  :  Union[str, Any]    ,snake_case_  :  Any						)       ->Tuple:



    '''simple docstring'''







    if i >= h:
        return

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

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

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

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

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


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




