





def 							SCREAMING_SNAKE_CASE__						(    ):
	snake_case_		:			str											=	[]
	snake_case_		:			str											=	1

	while len(__a   ) < 1E6:
		constant.append(str(__a   )   )
		i += 1

	snake_case_		:			Optional[int]											=	''.join(__a   )

	return (
	    int(constant[0]   )
	    * int(constant[9]   )
	    * int(constant[99]   )
	    * int(constant[9_99]   )
	    * int(constant[99_99]   )
	    * int(constant[9_99_99]   )
	    * int(constant[99_99_99]   )
	)


if __name__ == "__main__":
						print(solution())








from __future__ import annotations

from dataclasses import dataclass
@dataclass
class SCREAMING_SNAKE_CASE_						:
						__magic_name__:			float
						__magic_name__:			TreeNode | None       =       None
						__magic_name__:			TreeNode | None       =       None


def 							SCREAMING_SNAKE_CASE__						(    __a   ):

	# Validation
	def is_valid_tree(__a   ) -> 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(
	    __a   , __a   , __a   ) -> 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()

