


'''simple docstring'''
from __future__ import annotations
class    lowercase	:

		"""simple docstring"""

		def __init__(		self    ,   UpperCamelCase_							):

							'''simple docstring'''


							UpperCamelCase__   :str												= data
							UpperCamelCase__   :Node | None												= None
							UpperCamelCase__   :Node | None												= None



def 			a      (			__a   )  ->	None:  # In Order traversal of the tree



					'''simple docstring'''






					if tree:
										display(tree.left   )
										print(tree.data   )
										display(tree.right   )


def 			a      (			__a   )  ->	int:



					'''simple docstring'''






					return 1 + max(depth_of_tree(tree.left   ) ,					depth_of_tree(tree.right   )   ) if tree else 0


def 			a      (			__a   )  ->	bool:



					'''simple docstring'''






					if not tree:
										return True
					if tree.left and tree.right:
										return is_full_binary_tree(tree.left   ) and is_full_binary_tree(tree.right   )
					else:
										return not tree.left and not tree.right


def 			a      (			)  ->	None:  # Main function for testing.



					'''simple docstring'''






					UpperCamelCase__   :Dict												= Node(1   )
					UpperCamelCase__   :Tuple												= Node(2   )
					UpperCamelCase__   :Tuple												= Node(3   )
					UpperCamelCase__   :Any												= Node(4   )
					UpperCamelCase__   :List[Any]												= Node(5   )
					UpperCamelCase__   :List[str]												= Node(6   )
					UpperCamelCase__   :Union[str, Any]												= Node(7   )
					UpperCamelCase__   :List[Any]												= Node(8   )
					UpperCamelCase__   :int												= Node(9   )

					print(is_full_binary_tree(__a   )   )
					print(depth_of_tree(__a   )   )
					print('''Tree is: '''   )
					display(__a   )


if __name__ == "__main__":
		main()



'''simple docstring'''
from __future__ import annotations

from fractions import Fraction
from math import gcd, sqrt


def 			a      (			__a   )  ->	bool:



					'''simple docstring'''






					UpperCamelCase__   :int												= int(number**0.5   )
					return number == sq * sq


def 			a      (			__a ,					__a ,					__a ,					__a ,					__a ,					__a   )  ->	tuple[int, int]:



					'''simple docstring'''






					UpperCamelCase__   :int												= x_num * y_den * z_den + y_num * x_den * z_den + z_num * x_den * y_den
					UpperCamelCase__   :int												= x_den * y_den * z_den
					UpperCamelCase__   :int												= gcd(__a ,					__a   )
					top //= hcf
					bottom //= hcf
					return top, bottom


def 			a      (			__a = 35   )  ->	int:



					'''simple docstring'''






					UpperCamelCase__   :set												= set()
					UpperCamelCase__   :int
					UpperCamelCase__   :Fraction												= Fraction(0   )
					UpperCamelCase__   :tuple[int, int]

					for x_num in range(1 ,					order + 1   ):
										for x_den in range(x_num + 1 ,					order + 1   ):
															for y_num in range(1 ,					order + 1   ):
																				for y_den in range(y_num + 1 ,					order + 1   ):
																									# n=1
																									UpperCamelCase__   :int												= x_num * y_den + x_den * y_num
																									UpperCamelCase__   :Any												= x_den * y_den
																									UpperCamelCase__   :Tuple												= gcd(__a ,					__a   )
																									z_num //= hcf
																									z_den //= hcf
																									if 0 < z_num < z_den <= order:
																														UpperCamelCase__   :Tuple												= add_three(
																														    __a ,					__a ,					__a ,					__a ,					__a ,					__a   )
																														unique_s.add(__a   )

																									# n=2
																									UpperCamelCase__   :List[str]												= (
																									    x_num * x_num * y_den * y_den + x_den * x_den * y_num * y_num
																									)
																									UpperCamelCase__   :Dict												= x_den * x_den * y_den * y_den
																									if is_sq(__a   ) and is_sq(__a   ):
																														UpperCamelCase__   :Any												= int(sqrt(__a   )   )
																														UpperCamelCase__   :Optional[int]												= int(sqrt(__a   )   )
																														UpperCamelCase__   :int												= gcd(__a ,					__a   )
																														z_num //= hcf
																														z_den //= hcf
																														if 0 < z_num < z_den <= order:
																																			UpperCamelCase__   :Tuple												= add_three(
																																			    __a ,					__a ,					__a ,					__a ,					__a ,					__a   )
																																			unique_s.add(__a   )

                    # n=-1
																									UpperCamelCase__   :Tuple												= x_num * y_num
																									UpperCamelCase__   :Union[str, Any]												= x_den * y_num + x_num * y_den
																									UpperCamelCase__   :List[str]												= gcd(__a ,					__a   )
																									z_num //= hcf
																									z_den //= hcf
																									if 0 < z_num < z_den <= order:
																														UpperCamelCase__   :Union[str, Any]												= add_three(
																														    __a ,					__a ,					__a ,					__a ,					__a ,					__a   )
																														unique_s.add(__a   )

																									# n=2
																									UpperCamelCase__   :Optional[Any]												= x_num * x_num * y_num * y_num
																									UpperCamelCase__   :Tuple												= (
																									    x_den * x_den * y_num * y_num + x_num * x_num * y_den * y_den
																									)
																									if is_sq(__a   ) and is_sq(__a   ):
																														UpperCamelCase__   :str												= int(sqrt(__a   )   )
																														UpperCamelCase__   :Any												= int(sqrt(__a   )   )
																														UpperCamelCase__   :Dict												= gcd(__a ,					__a   )
																														z_num //= hcf
																														z_den //= hcf
																														if 0 < z_num < z_den <= order:
																																			UpperCamelCase__   :int												= add_three(
																																			    __a ,					__a ,					__a ,					__a ,					__a ,					__a   )
																																			unique_s.add(__a   )

					for num, den in unique_s:
										total += Fraction(__a ,					__a   )

					return total.denominator + total.numerator


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