


"""simple docstring"""





from itertools import count


def      _snake_case						(						_snake_case				:			int = 50			):
      lowerCAmelCase					:	List[Any]       =   [1] * min_block_length

      for n in count(_snake_case			):
            fill_count_functions.append(1			)

            for block_length in range(_snake_case ,   n + 1			):
                  for block_start in range(n - block_length			):
                        fill_count_functions[n] += fill_count_functions[
                            n - block_start - block_length - 1
                        ]

                  fill_count_functions[n] += 1

            if fill_count_functions[n] > 1000000:
                  break

      return n


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






"""simple docstring"""





class 		snake_case_:






     def __init__(	self  :					Union[str, Any]					,				UpperCamelCase_  :					str				):
           lowerCAmelCase					:	Dict       =   val
           lowerCAmelCase					:	str       =   None
           lowerCAmelCase					:	Dict       =   None






     def      lowerCamelCase__     (	self  :					Union[str, Any]					,				UpperCamelCase_  :					Dict				):
           if self.val:
                 if val < self.val:
                       if self.left is None:
                             lowerCAmelCase					:	int       =   Node(UpperCamelCase_				)
                       else:
                             self.left.insert(UpperCamelCase_				)
                 elif val > self.val:
                       if self.right is None:
                             lowerCAmelCase					:	Any       =   Node(UpperCamelCase_				)
                       else:
                             self.right.insert(UpperCamelCase_				)
           else:
                 lowerCAmelCase					:	Optional[Any]       =   val



def      _snake_case						(						_snake_case				:			Tuple ,   _snake_case				:			str			):
      # Recursive traversal
      if root:
            inorder(root.left ,   _snake_case			)
            res.append(root.val			)
            inorder(root.right ,   _snake_case			)


def      _snake_case						(						_snake_case				:			Optional[Any]			):
      # Build BST
      if len(_snake_case			) == 0:
            return arr
      lowerCAmelCase					:	Optional[Any]       =   Node(arr[0]			)
      for i in range(1 ,   len(_snake_case			)			):
            root.insert(arr[i]			)
      # Traverse BST in order.
      lowerCAmelCase					:	Optional[int]       =   []
      inorder(_snake_case ,   _snake_case			)
      return res


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


