






'''simple docstring'''







def 		_UpperCAmelCase (				__A				: list[int]   ):
				a_		:	Union[str, Any]									=   len(__A   )
				for i in range(__A   ):
								for j in range(i + 1    ,		__A   ):
												if numbers[j] < numbers[i]:
																a_					,      a_		:	List[str]									=   numbers[j], numbers[i]
				return numbers


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












'''simple docstring'''







def 		_UpperCAmelCase (				__A				: int   ):
				a_		:	Optional[Any]									=   []
				a_		:	Optional[Any]									=   []
				a_		:	List[str]									=   {
				    '''^''': 3,
				    '''*''': 2,
				    '''/''': 2,
				    '''%''': 2,
				    '''+''': 1,
				    '''-''': 1,
				}  # Priority of each operator
				a_		:	int									=   len(__A   ) if (len(__A   ) > 7) else 7

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

				for x in infix:
								if x.isalpha() or x.isdigit():
												post_fix.append(__A   )  # if x is Alphabet / Digit, add it to Postfix
								elif x == "(":
												stack.append(__A   )  # 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(__A   ) == 0:
																stack.append(__A   )  # If stack is empty, push x to stack
												else:  # while priority of x is not > priority of element in the stack
																while len(__A   ) > 0 and priority[x] <= priority[stack[-1]]:
																				post_fix.append(stack.pop()   )  # pop stack & add to Postfix
																stack.append(__A   )  # push x to stack

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

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

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





def 		_UpperCAmelCase (				__A				: Tuple   ):
				a_		:	Union[str, Any]									=   list(infix[::-1]   )  # reverse the infix equation

				for i in range(len(__A   )   ):
								if infix[i] == "(":
												a_		:	List[str]									=   ''')'''  # change "(" to ")"
								elif infix[i] == ")":
												a_		:	str									=   '''('''  # change ")" to "("

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


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




