


"""simple docstring"""







from __future__ import annotations


class 				SCREAMING_SNAKE_CASE__    :
							"""simple docstring"""


							def __init__(						self		,					snake_case__						):






									"""simple docstring"""





									lowerCAmelCase					:					Any								=							data
									lowerCAmelCase					:					Node | None								=							None
									lowerCAmelCase					:					Node | None								=							None

def  a__      (    SCREAMING_SNAKE_CASE   :   Node | None    ):  # In Order traversal of the tree


		'''simple docstring'''







		if tree:
				display(tree.left    )
				print(tree.data    )
				display(tree.right    )
def  a__      (    SCREAMING_SNAKE_CASE   :   Node | None    ):


		'''simple docstring'''







		return 1 + max(depth_of_tree(tree.left    )    ,				depth_of_tree(tree.right    )    ) if tree else 0
def  a__      (    SCREAMING_SNAKE_CASE   :   Node    ):


		'''simple docstring'''







		if not tree:
				return True
		if tree.left and tree.right:
				return is_full_binary_tree(tree.left    ) and is_full_binary_tree(tree.right    )
		else:
				return not tree.left and not tree.right
def  a__      (    ):  # Main function for testing.


		'''simple docstring'''







		lowerCAmelCase					:					Optional[int]								=							Node(1    )
		lowerCAmelCase					:					List[Any]								=							Node(2    )
		lowerCAmelCase					:					int								=							Node(3    )
		lowerCAmelCase					:					List[Any]								=							Node(4    )
		lowerCAmelCase					:					List[str]								=							Node(5    )
		lowerCAmelCase					:					Tuple								=							Node(6    )
		lowerCAmelCase					:					Optional[int]								=							Node(7    )
		lowerCAmelCase					:					Tuple								=							Node(8    )
		lowerCAmelCase					:					Optional[Any]								=							Node(9    )

		print(is_full_binary_tree(SCREAMING_SNAKE_CASE    )    )
		print(depth_of_tree(SCREAMING_SNAKE_CASE    )    )
		print("Tree is: "    )
		display(SCREAMING_SNAKE_CASE    )


if __name__ == "__main__":
					main()









"""simple docstring"""







def  a__      (    SCREAMING_SNAKE_CASE   :   list[int]    ):


  '''simple docstring'''







  lowerCAmelCase					:					str								=							len(SCREAMING_SNAKE_CASE    )
  for i in range(SCREAMING_SNAKE_CASE    ):
    for j in range(i + 1    ,				SCREAMING_SNAKE_CASE    ):
      if numbers[j] < numbers[i]:
        lowerCAmelCase						,  lowerCAmelCase					:					Any								=							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))





