"""simple docstring"""







from collections import defaultdict




def 						_lowercase				(  _SCREAMING_SNAKE_CASE				:				int = 5						)    ->     List[str]:







     '''simple docstring'''


     __A					:					List[str]								=		defaultdict(__UpperCamelCase						)
     __A					:					int								=		0

     while True:
          __A					:					Optional[Any]								=		get_digits(__UpperCamelCase						)
          freqs[digits].append(__UpperCamelCase						)

          if len(freqs[digits]						) == max_base:
               __A					:					str								=		freqs[digits][0] ** 3
               return base

          num += 1




def 						_lowercase				(  _SCREAMING_SNAKE_CASE				:				int						)    ->     str:







     '''simple docstring'''


     return "".join(sorted(str(num**3						)						)						)


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




"""simple docstring"""

class 		_lowercase :



						"""simple docstring"""




						def __init__(				self							:    List[str]     , UpperCamelCase__							:    int				)				->				None:
													'''simple docstring'''



													__UpperCamelCase							=data
													__UpperCamelCase							=None
													__UpperCamelCase							=None






def    lowerCAmelCase			(__UpperCamelCase							:    BinaryTreeNode | None							,					__UpperCamelCase							:    int			):
							"""simple docstring"""


							if node is None:
														__UpperCamelCase							=BinaryTreeNode(__UpperCamelCase			)
														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:
														__UpperCamelCase							=insert(node.left_child							,					__UpperCamelCase			)
							else:
														# if new_value is greater than value of data in node,
														#  add it to right subtree and proceed recursively
														__UpperCamelCase							=insert(node.right_child							,					__UpperCamelCase			)
							return node


def    lowerCAmelCase			(__UpperCamelCase							:    None | BinaryTreeNode			):  # if node is None,return
							"""simple docstring"""


							if node:
														__UpperCamelCase							=inorder(node.left_child			)
														__UpperCamelCase							=[*inorder_array, node.data]
														__UpperCamelCase							=inorder_array + inorder(node.right_child			)
							else:
														__UpperCamelCase							=[]
							return inorder_array


def    lowerCAmelCase			():
							"""simple docstring"""


							__UpperCamelCase							=insert(__UpperCamelCase							,					1_5			)
							insert(__UpperCamelCase							,					1_0			)
							insert(__UpperCamelCase							,					2_5			)
							insert(__UpperCamelCase							,					6			)
							insert(__UpperCamelCase							,					1_4			)
							insert(__UpperCamelCase							,					2_0			)
							insert(__UpperCamelCase							,					6_0			)
							return root


def    lowerCAmelCase			():
							"""simple docstring"""


							__UpperCamelCase							=make_tree()
							print('''Printing values of binary search tree in Inorder Traversal.'''			)
							inorder(__UpperCamelCase			)


if __name__ == "__main__":
				import doctest

				doctest.testmod()
				main()



