



"""simple docstring"""
from __future__ import annotations

def       _snake_case						(						UpperCamelCase						:		list[int]						):
 if len(UpperCamelCase						) == 0:
  return array

 UpperCAmelCase	,		UpperCAmelCase	:					Optional[Any]	=	min(UpperCamelCase						), max(UpperCamelCase						)

 # Compute the variables
 UpperCAmelCase	:					Any	=	_max - _min + 1
 UpperCAmelCase	,		UpperCAmelCase	:					List[Any]	=	[0] * holes_range, [0] * holes_range

 # Make the sorting.
 for i in array:
  UpperCAmelCase	:					Optional[int]	=	i - _min
  UpperCAmelCase	:					Optional[Any]	=	i
  holes_repeat[index] += 1

 # Makes the array back by replacing the numbers.
 UpperCAmelCase	:					int	=	0
 for i in range(UpperCamelCase						):
  while holes_repeat[i] > 0:
   UpperCAmelCase	:					List[str]	=	holes[i]
   index += 1
   holes_repeat[i] -= 1

    # Returns the sorted array.
 return array


if __name__ == "__main__":
      import doctest

      doctest.testmod()
      A:   List[str]								=		input("Enter numbers separated by comma:\n")
      A:   Tuple								=		[int(x) for x in user_input.split(",")]
      print(pigeon_sort(unsorted))





"""simple docstring"""
from __future__ import annotations



class       SCREAMING_SNAKE_CASE__  :

   def __init__(   self      ,     _SCREAMING_SNAKE_CASE						)  ->      None:





    '''simple docstring'''




    UpperCAmelCase	:					Any	=	data
    UpperCAmelCase	:					Node | None	=	None
    UpperCAmelCase	:					Node | None	=	None

def       _snake_case						(						UpperCamelCase						:		Node | None						):  # In Order traversal of the tree
 if tree:
  display(tree.left						)
  print(tree.data						)
  display(tree.right						)

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

def       _snake_case						(						UpperCamelCase						:		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       _snake_case						(						):  # Main function for testing.
 UpperCAmelCase	:					int	=	Node(1						)
 UpperCAmelCase	:					Tuple	=	Node(2						)
 UpperCAmelCase	:					Any	=	Node(3						)
 UpperCAmelCase	:					Optional[int]	=	Node(4						)
 UpperCAmelCase	:					Any	=	Node(5						)
 UpperCAmelCase	:					Optional[int]	=	Node(6						)
 UpperCAmelCase	:					int	=	Node(7						)
 UpperCAmelCase	:					str	=	Node(8						)
 UpperCAmelCase	:					str	=	Node(9						)

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


if __name__ == "__main__":
      main()
