





class        SCREAMING_SNAKE_CASE     :


   def __init__(					self    :       Any    ,  a    :       List[Any] )->     Any:





     """simple docstring"""







     lowercase__			    =						val
     lowercase__			    =						None
     lowercase__			    =						None


   def  SCREAMING_SNAKE_CASE_							(					self    :       Optional[Any]    ,  a    :       List[Any] )->     str:





     """simple docstring"""







     if self.val:
       if val < self.val:
         if self.left is None:
           lowercase__			    =						Node(__A )
         else:
           self.left.insert(__A )
       elif val > self.val:
         if self.right is None:
           lowercase__			    =						Node(__A )
         else:
           self.right.insert(__A )
     else:
       lowercase__			    =						val






def     __UpperCamelCase						(_SCREAMING_SNAKE_CASE	,		_SCREAMING_SNAKE_CASE	)       ->     Optional[Any]:







  if root:
    inorder(root.left	,		_lowercase	)
    res.append(root.val	)
    inorder(root.right	,		_lowercase	)




def     __UpperCamelCase						(_SCREAMING_SNAKE_CASE	)       ->     Any:







  if len(_lowercase	) == 0:
    return arr
  lowercase__			    =						Node(arr[0]	)
  for i in range(1	,		len(_lowercase	)	):
    root.insert(arr[i]	)
  # Traverse BST in order.
  lowercase__			    =						[]
  inorder(_lowercase	,		_lowercase	)
  return res


if __name__ == "__main__":
      print(tree_sort([10, 1, 3, 2, 9, 14, 13]))









def     __UpperCamelCase						(_SCREAMING_SNAKE_CASE	)       ->     List[Any]:
  stooge(_SCREAMING_SNAKE_CASE	,		0	,		len(_SCREAMING_SNAKE_CASE	) - 1	)
  return arr




def     __UpperCamelCase						(_SCREAMING_SNAKE_CASE	,		_SCREAMING_SNAKE_CASE	,		_SCREAMING_SNAKE_CASE	)       ->     int:
  if i >= h:
    return

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

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

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

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

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


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


