'''simple docstring'''






def  UpperCamelCase__					(					_lowercase    :				list[int]     )							->	list[int]:
  __UpperCAmelCase:					Optional[int]		= len(_lowercase     )
  for i in range(_lowercase     ):
    for j in range(i + 1   ,    _lowercase     ):
      if numbers[j] < numbers[i]:
        __UpperCAmelCase, __UpperCAmelCase:					Tuple		= numbers[j], numbers[i]
  return numbers


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(exchange_sort(unsorted))
'''simple docstring'''






def  UpperCamelCase__					(					_lowercase    :				List[str]     )							->	Union[str, Any]:
  __UpperCAmelCase:					int		= []
  __UpperCAmelCase:					List[Any]		= []
  __UpperCAmelCase:					List[Any]		= {
      """^""": 3,
      """*""": 2,
      """/""": 2,
      """%""": 2,
      """+""": 1,
      """-""": 1,
  }  # Priority of each operator
  __UpperCAmelCase:					int		= len(_lowercase     ) if (len(_lowercase     ) > 7) else 7

  # Print table header for output
  print(
      """Symbol""".center(8     )   ,    """Stack""".center(_lowercase     )   ,    """Postfix""".center(_lowercase     )   ,    sep=""" | """   ,    )
  print("""-""" * (print_width * 3 + 7)     )

  for x in infix:
    if x.isalpha() or x.isdigit():
      post_fix.append(_lowercase     )  # if x is Alphabet / Digit, add it to Postfix
    elif x == "(":
      stack.append(_lowercase     )  # if x is "(" push to Stack
    elif x == ")":  # if x is ")" pop stack until "(" is encountered
      while stack[-1] != "(":
        post_fix.append(stack.pop()     )  # Pop stack & add the content to Postfix
      stack.pop()
    else:
      if len(_lowercase     ) == 0:
        stack.append(_lowercase     )  # If stack is empty, push x to stack
      else:  # while priority of x is not > priority of element in the stack
        while len(_lowercase     ) > 0 and priority[x] <= priority[stack[-1]]:
          post_fix.append(stack.pop()     )  # pop stack & add to Postfix
        stack.append(_lowercase     )  # push x to stack

    print(
        x.center(8     )   ,    ("""""".join(_lowercase     )).ljust(_lowercase     )   ,    ("""""".join(_lowercase     )).ljust(_lowercase     )   ,    sep=""" | """   ,    )  # Output in tabular format

  while len(_lowercase     ) > 0:  # while stack is not empty
    post_fix.append(stack.pop()     )  # pop stack & add to Postfix
    print(
        """ """.center(8     )   ,    ("""""".join(_lowercase     )).ljust(_lowercase     )   ,    ("""""".join(_lowercase     )).ljust(_lowercase     )   ,    sep=""" | """   ,    )  # Output in tabular format

  return "".join(_lowercase     )  # return Postfix as str






def  UpperCamelCase__					(					_lowercase    :				str     )							->	Tuple:
  __UpperCAmelCase:					Union[str, Any]		= list(infix[::-1]     )  # reverse the infix equation

  for i in range(len(_lowercase     )     ):
    if infix[i] == "(":
      __UpperCAmelCase:					Tuple		= """)"""  # change "(" to ")"
    elif infix[i] == ")":
      __UpperCAmelCase:					Union[str, Any]		= """("""  # change ")" to "("

  return (infix_2_postfix("""""".join(_lowercase     )     ))[
      ::-1
  ]  # call infix_2_postfix on Infix, return reverse of Postfix


if __name__ == "__main__":
    SCREAMING_SNAKE_CASE_	   =			input('\nEnter an Infix Equation = ')  # Input an Infix equation
    SCREAMING_SNAKE_CASE_	   =			''.join(Infix.split())  # Remove spaces from the input
    print('\n\t', Infix, '(Infix) -> ', infix_2_prefix(Infix), '(Prefix)')