'''simple docstring'''




from __future__ import annotations

from dataclasses import dataclass




@dataclass
class     a__      :
     lowerCamelCase  :     float
     lowerCamelCase  :     TreeNode | None							=None
     lowerCamelCase  :     TreeNode | None							=None






def __lowerCAmelCase (							UpperCamelCase__				)	->    List[Any]:







    def is_valid_tree(UpperCamelCase__				) -> bool:
        if node is None:
            return True

        if not isinstance(_A				,  _A				):
            return False

        try:
            float(node.data				)
        except (TypeError, ValueError):
            return False

        return is_valid_tree(node.left				) and is_valid_tree(node.right				)

    if not is_valid_tree(_A				):
        raise ValueError(
            '''Each node should be type of TreeNode and data should be float.'''				)

    def is_binary_search_tree_recursive_check(
        UpperCamelCase__				,  UpperCamelCase__				,  UpperCamelCase__				) -> bool:

        if node is None:
            return True

        return (
            left_bound < node.data < right_bound
            and is_binary_search_tree_recursive_check(node.left				,  _A				,  node.data				)
            and is_binary_search_tree_recursive_check(
                node.right				,  node.data				,  _A				)
        )

    return is_binary_search_tree_recursive_check(_A				,  -float('''inf'''				)				,  float('''inf'''				)				)


if __name__ == "__main__":
  import doctest

  doctest.testmod()



def 			UpperCAmelCase__				(			):





  '''simple docstring'''







  return [
      a * b * (10_00 - a - b)
      for a in range(1	,      9_99							)
      for b in range(_A	,      9_99							)
      if (a * a + b * b == (10_00 - a - b) ** 2)
  ][0]


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