






"""simple docstring"""
class 		a_      :







      '''simple docstring'''

      def __init__(self,     lowerCamelCase_					):

       '''simple docstring'''



       lowerCamelCase__     :			int     				=						data
       lowerCamelCase__     :			BinaryTreeNode | None     				=						None
       lowerCamelCase__     :			BinaryTreeNode | None     				=						None






def        lowerCamelCase_  (						_lowerCamelCase			,   _lowerCamelCase				):






 if node is None:
  lowerCamelCase__     :			Optional[int]     				=						BinaryTreeNode(_lowerCamelCase				)
  return node

 # binary search tree is not empty,
 # so we will insert it into the tree
 # if new_value is less than value of data in node,
 #  add it to left subtree and proceed recursively
 if new_value < node.data:
  lowerCamelCase__     :			List[Any]     				=						insert(node.left_child			,   _lowerCamelCase				)
 else:
  # if new_value is greater than value of data in node,
  #  add it to right subtree and proceed recursively
  lowerCamelCase__     :			List[Any]     				=						insert(node.right_child			,   _lowerCamelCase				)
 return node






def        lowerCamelCase_  (						_lowerCamelCase				):  # if node is None,return






 if node:
  lowerCamelCase__     :			int     				=						inorder(node.left_child				)
  lowerCamelCase__     :			Optional[int]     				=						[*inorder_array, node.data]
  lowerCamelCase__     :			Union[str, Any]     				=						inorder_array + inorder(node.right_child				)
 else:
  lowerCamelCase__     :			str     				=						[]
 return inorder_array






def        lowerCamelCase_  (						):
 lowerCamelCase__     :			List[Any]     				=						insert(_lowerCamelCase			,   15				)
 insert(_lowerCamelCase			,   10				)
 insert(_lowerCamelCase			,   25				)
 insert(_lowerCamelCase			,   6				)
 insert(_lowerCamelCase			,   14				)
 insert(_lowerCamelCase			,   20				)
 insert(_lowerCamelCase			,   60				)
 return root






def        lowerCamelCase_  (						):
 lowerCamelCase__     :			Optional[Any]     				=						make_tree()
 print('Printing values of binary search tree in Inorder Traversal.'				)
 inorder(_lowerCamelCase				)


if __name__ == "__main__":
      import doctest

      doctest.testmod()
      main()







def  lowerCAmelCase  (	UpperCAmelCase       )  ->int:






					"""simple docstring"""






					return n * (2 * n - 1)







def  lowerCAmelCase  (	UpperCAmelCase       )  ->bool:






					"""simple docstring"""






					__magic_name__					:							Any		   =							(1 + 24 * n) ** 0.5
					return ((1 + root) / 6) % 1 == 0







def  lowerCAmelCase  (	UpperCAmelCase = 144       )  ->int:






					"""simple docstring"""






					__magic_name__					:							Optional[int]		   =							start
					__magic_name__					:							int		   =							hexagonal_num(UpperCAmelCase       )
					while not is_pentagonal(UpperCAmelCase       ):
										n += 1
										__magic_name__					:							Optional[int]		   =							hexagonal_num(UpperCAmelCase       )
					return num


if __name__ == "__main__":
				print(f"{solution()} = ")



