






"""simple docstring"""
from functools import reduce

lowerCamelCase_					=      (
    '''73167176531330624919225119674426574742355349194934'''
    '''96983520312774506326239578318016984801869478851843'''
    '''85861560789112949495459501737958331952853208805511'''
    '''12540698747158523863050715693290963295227443043557'''
    '''66896648950445244523161731856403098711121722383113'''
    '''62229893423380308135336276614282806444486645238749'''
    '''30358907296290491560440772390713810515859307960866'''
    '''70172427121883998797908792274921901699720888093776'''
    '''65727333001053367881220235421809751254540594752243'''
    '''52584907711670556013604839586446706324415722155397'''
    '''53697817977846174064955149290862569321978468622482'''
    '''83972241375657056057490261407972968652414535100474'''
    '''82166370484403199890008895243450658541227588666881'''
    '''16427171479924442928230863465674813919123162824586'''
    '''17866458359124566529476545682848912883142607690042'''
    '''24219022671055626321111109370544217506941658960408'''
    '''07198403850962455444362981230987879927244284909188'''
    '''84580156166097919133875499200524063689912560717606'''
    '''05886116467109405077541002256983155200055935729725'''
    '''71636269561882670428252483600823257530420752963450'''
)

def 				snake_case      (   A__ = N						):
			return max(
			    # mypy cannot properly interpret reduce
			    int(reduce(lambda A__	,A__						: str(int(A__						) * int(A__						)						)	,n[i : i + 13]						)						)
			    for i in range(len(A__						) - 12						)						)


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











"""simple docstring"""
from __future__ import annotations







class 			UpperCamelCase_       :





	def __init__(      self					: Any	,	lowerCAmelCase_					: int						)						->			None:
				UpperCAmelCase_     : Any			     =					data
				UpperCAmelCase_     : Node | None			     =					None
				UpperCAmelCase_     : Node | None			     =					None





def 				snake_case      (   A__						):  # In Order traversal of the tree
			if tree:
						display(tree.left						)
						print(tree.data						)
						display(tree.right						)

def 				snake_case      (   A__						):
			return 1 + max(depth_of_tree(tree.left						)	,depth_of_tree(tree.right						)						) if tree else 0

def 				snake_case      (   A__						):
			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 				snake_case      (   ):  # Main function for testing.
			UpperCAmelCase_     : List[str]			     =					Node(1						)
			UpperCAmelCase_     : Any			     =					Node(2						)
			UpperCAmelCase_     : Optional[Any]			     =					Node(3						)
			UpperCAmelCase_     : Union[str, Any]			     =					Node(4						)
			UpperCAmelCase_     : int			     =					Node(5						)
			UpperCAmelCase_     : Optional[int]			     =					Node(6						)
			UpperCAmelCase_     : Any			     =					Node(7						)
			UpperCAmelCase_     : List[str]			     =					Node(8						)
			UpperCAmelCase_     : List[Any]			     =					Node(9						)

			print(is_full_binary_tree(A__						)						)
			print(depth_of_tree(A__						)						)
			print("Tree is: "						)
			display(A__						)


if __name__ == "__main__":
			main()



