




def      A      (      _SCREAMING_SNAKE_CASE    )	-> Any:
       lowerCamelCase   :      Optional[Any]			 =					[]
       lowerCamelCase   :      str			 =					set({"(", "[", "{"}    )
       lowerCamelCase   :      int			 =					set({")", "]", "}"}    )
       lowerCamelCase   :      Union[str, Any]			 =					{"{": "}", "[": "]", "(": ")"}

       for i in range(len(_SCREAMING_SNAKE_CASE    )    ):
              if s[i] in open_brackets:
                     stack.append(s[i]    )

              elif s[i] in closed_brackets and (
                  len(_SCREAMING_SNAKE_CASE    ) == 0 or (len(_SCREAMING_SNAKE_CASE    ) > 0 and open_to_closed[stack.pop()] != s[i])
              ):
                     return False

       return len(_SCREAMING_SNAKE_CASE    ) == 0

def      A      (      )	-> Union[str, Any]:
       lowerCamelCase   :      int			 =					input("Enter sequence of brackets: "    )
       if is_balanced(_SCREAMING_SNAKE_CASE    ):
              print(_SCREAMING_SNAKE_CASE ,"is balanced"    )
       else:
              print(_SCREAMING_SNAKE_CASE ,"is not balanced"    )


if __name__ == "__main__":
       main()












def 						lowerCamelCase__    (		_A							):







	'''simple docstring'''





	snake_case_		    =     len(_A							)
	for i in range(_A							):
		for j in range(i + 1     ,	_A							):
			if numbers[j] < numbers[i]:
				snake_case_    ,      snake_case_		    =     numbers[j], numbers[i]
	return numbers


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