

from __future__ import annotations





def 	__a     (      A__			:  list			,  A__			:  int			,  A__			:  int			,  A__			:  int       ):
    SCREAMING_SNAKE_CASE										=   []
    SCREAMING_SNAKE_CASE							,	SCREAMING_SNAKE_CASE										=   input_list[low:mid], input_list[mid : high + 1]
    while left and right:
        result.append((left if left[0] <= right[0] else right).pop(0       )       )
    SCREAMING_SNAKE_CASE										=   result + left + right
    return input_list





def 	__a     (      A__			:  list       ):
    if len(A__       ) <= 1:
        return input_list
    SCREAMING_SNAKE_CASE										=   list(A__       )

    # iteration for two-way merging
    SCREAMING_SNAKE_CASE										=   2
    while p <= len(A__       ):
        # getting low, high and middle value for merge-sort of single list
        for i in range(0			,  len(A__       )			,  A__       ):
            SCREAMING_SNAKE_CASE										=   i
            SCREAMING_SNAKE_CASE										=   i + p - 1
            SCREAMING_SNAKE_CASE										=   (low + high + 1) // 2
            SCREAMING_SNAKE_CASE										=   merge(A__			,  A__			,  A__			,  A__       )
        # final merge of last two parts
        if p * 2 >= len(A__       ):
            SCREAMING_SNAKE_CASE										=   i
            SCREAMING_SNAKE_CASE										=   merge(A__			,  0			,  A__			,  len(A__       ) - 1       )
            break
        p *= 2

    return input_list


if __name__ == "__main__":
    __A			:					Any						=			input('Enter numbers separated by a comma:\n').strip()
    if user_input == "":
        __A			:					Union[str, Any]						=			[]
    else:
        __A			:					Optional[Any]						=			[int(item.strip()) for item in user_input.split(',')]
    print(iter_merge_sort(unsorted))







"""simple docstring"""
import operator as op





def 				lowercase__		(					lowerCamelCase       ):
				_SCREAMING_SNAKE_CASE   :		int       		=    []
				_SCREAMING_SNAKE_CASE   :		Dict       		=    lambda lowerCamelCase,						lowerCamelCase       : int(x / y       )  # noqa: E731 integer division operation
				_SCREAMING_SNAKE_CASE   :		Tuple       		=    {
				    '^': op.pow,
				    '*': op.mul,
				    '/': div,
				    '+': op.add,
				    '-': op.sub,
				}  # operators & their respective operation

				# print table header
				print('Symbol'.center(8       ),						'Action'.center(12       ),						'Stack',						sep=' | '       )
				print('-' * (30 + len(lowerCamelCase       ))       )

				for x in post_fix:
								if x.isdigit():  # if x in digit
												stack.append(lowerCamelCase       )  # append x to stack
												# output in tabular format
												print(x.rjust(8       ),						('push(' + x + ')').ljust(12       ),						','.join(lowerCamelCase       ),						sep=' | '       )
								else:
												_SCREAMING_SNAKE_CASE   :		int       		=    stack.pop()  # pop stack
												# output in tabular format
												print(''.rjust(8       ),						('pop(' + b + ')').ljust(12       ),						','.join(lowerCamelCase       ),						sep=' | '       )

												_SCREAMING_SNAKE_CASE   :		Tuple       		=    stack.pop()  # pop stack
												# output in tabular format
												print(''.rjust(8       ),						('pop(' + a + ')').ljust(12       ),						','.join(lowerCamelCase       ),						sep=' | '       )

												stack.append(
												    str(opr[x](int(lowerCamelCase       ),						int(lowerCamelCase       )       )       )       )  # evaluate the 2 values popped from stack & push result to stack
												# output in tabular format
												print(
												    x.rjust(8       ),						('push(' + a + x + b + ')').ljust(12       ),						','.join(lowerCamelCase       ),						sep=' | ',						)

				return int(stack[0]       )


if __name__ == "__main__":
			lowerCAmelCase__    						=			input('\n\nEnter a Postfix Equation (space separated) = ').split(' ')
			print('\n\tResult = ', solve(Postfix))

