
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  lowerCAmelCase__			(  SCREAMING_SNAKE_CASE_ = N     )				->		int:
			return max(
			    # mypy cannot properly interpret reduce
			    int(reduce(lambda SCREAMING_SNAKE_CASE_       ,							SCREAMING_SNAKE_CASE_     : str(int(__lowerCAmelCase     ) * int(__lowerCAmelCase     )     )       ,							n[i : i + 13]     )     )
			    for i in range(len(__lowerCAmelCase     ) - 12     )     )


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







class __lowerCamelCase :





	"""simple docstring"""






	def __init__(							self    ):
							"""simple docstring"""







							_UpperCAmelCase									=			{}  # Mapping from char to TrieNode
							_UpperCAmelCase									=			False

	def        UpperCamelCase    (							self       ,    UpperCAmelCase    ):
							"""simple docstring"""







							for word in words:
													self.insert(UpperCAmelCase    )

	def        UpperCamelCase    (							self       ,    UpperCAmelCase    ):
							"""simple docstring"""







							_UpperCAmelCase									=			self
							for char in word:
													if char not in curr.nodes:
																			_UpperCAmelCase									=			TrieNode()
													_UpperCAmelCase									=			curr.nodes[char]
							_UpperCAmelCase									=			True

	def        UpperCamelCase    (							self       ,    UpperCAmelCase    ):
							"""simple docstring"""







							_UpperCAmelCase									=			self
							for char in word:
													if char not in curr.nodes:
																			return False
													_UpperCAmelCase									=			curr.nodes[char]
							return curr.is_leaf

	def        UpperCamelCase    (							self       ,    UpperCAmelCase    ):
							"""simple docstring"""







							def _delete(UpperCAmelCase       ,    UpperCAmelCase       ,    UpperCAmelCase    ) -> bool:
													if index == len(UpperCAmelCase    ):
																			# If word does not exist
																			if not curr.is_leaf:
																									return False
																			_UpperCAmelCase									=			False
																			return len(curr.nodes    ) == 0
													_UpperCAmelCase									=			word[index]
													_UpperCAmelCase									=			curr.nodes.get(UpperCAmelCase    )
													# If char not in current trie node
													if not char_node:
																			return False
													# Flag to check if node can be deleted
													_UpperCAmelCase									=			_delete(UpperCAmelCase       ,    UpperCAmelCase       ,    index + 1    )
													if delete_curr:
																			del curr.nodes[char]
																			return len(curr.nodes    ) == 0
													return delete_curr

							_delete(self       ,    UpperCAmelCase       ,    0    )



def __A    (      __lowerCAmelCase ,		__lowerCAmelCase	)->  None:





						"""simple docstring"""



						if node.is_leaf:
												print(__lowerCAmelCase ,		end=' '	)

						for key, value in node.nodes.items():
												print_words(__lowerCAmelCase ,		word + key	)


def __A    (      )->  bool:





						"""simple docstring"""



						_UpperCAmelCase									=			'banana bananas bandana band apple all beast'.split()
						_UpperCAmelCase									=			TrieNode()
						root.insert_many(__lowerCAmelCase	)
						# print_words(root, "")
						assert all(root.find(__lowerCAmelCase	) for word in words	)
						assert root.find('banana'	)
						assert not root.find('bandanas'	)
						assert not root.find('apps'	)
						assert root.find('apple'	)
						assert root.find('all'	)
						root.delete('all'	)
						assert not root.find('all'	)
						root.delete('banana'	)
						assert not root.find('banana'	)
						assert root.find('bananas'	)
						return True


def __A    (      __lowerCAmelCase ,		__lowerCAmelCase	)->  None:





						"""simple docstring"""



						print(str(__lowerCAmelCase	) ,		'works!' if passes else 'doesn\'t work :('	)


def __A    (      )->  None:





						"""simple docstring"""



						assert test_trie()


def __A    (      )->  None:





						"""simple docstring"""



						print_results('Testing trie functionality' ,		test_trie()	)


if __name__ == "__main__":
		main()
