





'''simple docstring'''






from __future__ import annotations
class 		lowerCamelCase	:



	def __init__( self		,   a_						):
			lowerCAmelCase  :     Union[str, Any]       						= data
			lowerCAmelCase  :     List[str]       						= None
			lowerCAmelCase  :     str       						= None






def   __A    (				a_    :	Node | None						):  # In Order traversal of the tree

		if tree:
				display(tree.left						)
				print(tree.data						)
				display(tree.right						)






def   __A    (				a_    :	Node | None						):
		return 1 + max(depth_of_tree(tree.left						)   ,depth_of_tree(tree.right						)						) if tree else 0






def   __A    (				a_    :	Node						):

		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.
		lowerCAmelCase  :     List[str]       						= Node(1						)
		lowerCAmelCase  :     int       						= Node(2						)
		lowerCAmelCase  :     Optional[Any]       						= Node(3						)
		lowerCAmelCase  :     Tuple       						= Node(4						)
		lowerCAmelCase  :     Dict       						= Node(5						)
		lowerCAmelCase  :     Optional[int]       						= Node(6						)
		lowerCAmelCase  :     List[str]       						= Node(7						)
		lowerCAmelCase  :     Tuple       						= Node(8						)
		lowerCAmelCase  :     Any       						= Node(9						)

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


if __name__ == "__main__":
					main()











def       _SCREAMING_SNAKE_CASE    (			__lowercase :      List[Any]     )    ->   Any:





    """simple docstring"""

    stooge(__lowercase      ,					0      ,					len(__lowercase     ) - 1     )
    return arr



def       _SCREAMING_SNAKE_CASE    (			__lowercase :      str      ,					__lowercase :      Dict      ,					__lowercase :      Dict     )    ->   int:





    """simple docstring"""

    if i >= h:
        return

    # If first element is smaller than the last then swap them
    if arr[i] > arr[h]:
        __A     ,						__A       =						arr[h], arr[i]

    # If there are more than 2 elements in the array
    if h - i + 1 > 2:
        __A       =						(int)((h - i + 1) / 3     )

        # Recursively sort first 2/3 elements
        stooge(__lowercase      ,					__lowercase      ,					(h - t)     )

        # Recursively sort last 2/3 elements
        stooge(__lowercase      ,					i + t      ,					(__lowercase)     )

        # Recursively sort first 2/3 elements
        stooge(__lowercase      ,					__lowercase      ,					(h - t)     )


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




