




from __future__ import annotations
class      a__       :






						def __init__(  self						,     _A = 0     ):




											"""simple docstring"""



											__lowerCAmelCase							  =			value
											__lowerCAmelCase							  =			None
											__lowerCAmelCase							  =			None







def       _a (		SCREAMING_SNAKE_CASE_				:							Node | None , SCREAMING_SNAKE_CASE_				:							Node | None	):
					if treea is None:
										return treea
					if treea is None:
										return treea

					__lowerCAmelCase							  =			treea.value + treea.value
					__lowerCAmelCase							  =			merge_two_binary_trees(treea.left , treea.left	)
					__lowerCAmelCase							  =			merge_two_binary_trees(treea.right , treea.right	)
					return treea







def       _a (		SCREAMING_SNAKE_CASE_				:							Node | None	):
					if root:
										print(root.value	)
										print_preorder(root.left	)
										print_preorder(root.right	)


if __name__ == "__main__":
					UpperCamelCase__            =     Node(1)
					UpperCamelCase__            =     Node(2)
					UpperCamelCase__            =     Node(3)
					UpperCamelCase__            =     Node(4)

					UpperCamelCase__            =     Node(2)
					UpperCamelCase__            =     Node(4)
					UpperCamelCase__            =     Node(6)
					UpperCamelCase__            =     Node(9)
					UpperCamelCase__            =     Node(5)

					print("""Tree1 is: """)
					print_preorder(treea)
					print("""Tree2 is: """)
					print_preorder(treea)
					UpperCamelCase__            =     merge_two_binary_trees(treea, treea)
					print("""Merged Tree is: """)
					print_preorder(merged_tree)










import decimal







def       _a (		):
					__lowerCAmelCase							  =			0
					__lowerCAmelCase							  =			decimal.Context(prec=1_05	)
					for i in range(2 , 1_00	):
										__lowerCAmelCase							  =			decimal.Decimal(SCREAMING_SNAKE_CASE_	)
										__lowerCAmelCase							  =			number.sqrt(SCREAMING_SNAKE_CASE_	)
										if len(str(SCREAMING_SNAKE_CASE_	)	) > 1:
															answer += int(str(SCREAMING_SNAKE_CASE_	)[0]	)
															__lowerCAmelCase							  =			str(SCREAMING_SNAKE_CASE_	)[2:1_01]
															answer += sum(int(SCREAMING_SNAKE_CASE_	) for x in sqrt_number_str	)
					return answer


if __name__ == "__main__":
					import doctest

					doctest.testmod()
					print(f'''{solution() = }''')




