


'''simple docstring'''
import sys

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


def     a   (    __a     )						->			int:



					'''simple docstring'''






					UpperCamelCase__     :Tuple							      =				1
					for digit in s:
										product *= int(__a     )
					return product


def     a   (    __a = N     )						->			int:



					'''simple docstring'''






					UpperCamelCase__     :Tuple							      =				-sys.maxsize - 1
					UpperCamelCase__     :Dict							      =				n[:13]
					UpperCamelCase__     :Dict							      =				13
					while cur_index < len(__a     ) - 13:
										if int(n[cur_index]     ) >= int(substr[0]     ):
															UpperCamelCase__     :Dict							      =				substr[1:] + n[cur_index]
															cur_index += 1
										else:
															UpperCamelCase__     :List[str]							      =				max(__a				,      str_eval(__a     )     )
															UpperCamelCase__     :Union[str, Any]							      =				n[cur_index : cur_index + 13]
															cur_index += 13
					return largest_product


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



'''simple docstring'''
class      lowercase			:

		"""simple docstring"""

		def __init__(	self					,     UpperCamelCase_ = ""					,     UpperCamelCase_ = False							):

							'''simple docstring'''


							UpperCamelCase__     :dict[str, RadixNode]							      =				{}

							# A node will be a leaf if the tree contains its word
							UpperCamelCase__     :List[Any]							      =				is_leaf

							UpperCamelCase__     :Dict							      =				prefix




		def 					lowerCAmelCase__       (	self					,     UpperCamelCase_							):

							'''simple docstring'''


							UpperCamelCase__     :Any							      =				0
							for q, w in zip(self.prefix					,     UpperCamelCase_							):
												if q != w:
																	break

												x += 1

							return self.prefix[:x], self.prefix[x:], word[x:]




		def 					lowerCAmelCase__       (	self					,     UpperCamelCase_							):

							'''simple docstring'''


							for word in words:
												self.insert(UpperCamelCase_							)




		def 					lowerCAmelCase__       (	self					,     UpperCamelCase_							):

							'''simple docstring'''


							if self.prefix == word:
												UpperCamelCase__     :Tuple							      =				True

							# Case 2: The node has no edges that have a prefix to the word
							# Solution: We create an edge from the current node to a new one
							# containing the word
							elif word[0] not in self.nodes:
												UpperCamelCase__     :Optional[Any]							      =				RadixNode(prefix=UpperCamelCase_					,     is_leaf=UpperCamelCase_							)

							else:
												UpperCamelCase__     :Optional[Any]							      =				self.nodes[word[0]]
												UpperCamelCase__      ,       UpperCamelCase__      ,       UpperCamelCase__     :List[Any]							      =				incoming_node.match(
												    UpperCamelCase_							)

												# Case 3: The node prefix is equal to the matching
												# Solution: We insert remaining word on the next node
												if remaining_prefix == "":
																	self.nodes[matching_string[0]].insert(UpperCamelCase_							)

												# Case 4: The word is greater equal to the matching
												# Solution: Create a node in between both nodes, change
												# prefixes and add the new node for the remaining word
												else:
																	UpperCamelCase__     :str							      =				remaining_prefix

																	UpperCamelCase__     :Optional[Any]							      =				self.nodes[matching_string[0]]
																	UpperCamelCase__     :Dict							      =				RadixNode(UpperCamelCase_					,     UpperCamelCase_							)
																	UpperCamelCase__     :List[Any]							      =				aux_node

																	if remaining_word == "":
																						UpperCamelCase__     :List[Any]							      =				True
																	else:
																						self.nodes[matching_string[0]].insert(UpperCamelCase_							)




		def 					lowerCAmelCase__       (	self					,     UpperCamelCase_							):

							'''simple docstring'''


							UpperCamelCase__     :List[Any]							      =				self.nodes.get(word[0]					,     UpperCamelCase_							)
							if not incoming_node:
												return False
							else:
												UpperCamelCase__      ,       UpperCamelCase__      ,       UpperCamelCase__     :Tuple							      =				incoming_node.match(
												    UpperCamelCase_							)
												# If there is remaining prefix, the word can't be on the tree
												if remaining_prefix != "":
																	return False
												# This applies when the word and the prefix are equal
												elif remaining_word == "":
																	return incoming_node.is_leaf
												# We have word remaining so we check the next node
												else:
																	return incoming_node.find(UpperCamelCase_							)




		def 					lowerCAmelCase__       (	self					,     UpperCamelCase_							):

							'''simple docstring'''


							UpperCamelCase__     :str							      =				self.nodes.get(word[0]					,     UpperCamelCase_							)
							if not incoming_node:
												return False
							else:
												UpperCamelCase__      ,       UpperCamelCase__      ,       UpperCamelCase__     :Tuple							      =				incoming_node.match(
												    UpperCamelCase_							)
												# If there is remaining prefix, the word can't be on the tree
												if remaining_prefix != "":
																	return False
												# We have word remaining so we check the next node
												elif remaining_word != "":
																	return incoming_node.delete(UpperCamelCase_							)
												else:
																	# If it is not a leaf, we don't have to delete
																	if not incoming_node.is_leaf:
																						return False
																	else:
																						# We delete the nodes if no edges go from it
																						if len(incoming_node.nodes							) == 0:
																											del self.nodes[word[0]]
																											# We merge the current node with its only child
																											if len(self.nodes							) == 1 and not self.is_leaf:
																																UpperCamelCase__     :Tuple							      =				list(self.nodes.values()							)[0]
																																UpperCamelCase__     :Union[str, Any]							      =				merging_node.is_leaf
																																self.prefix += merging_node.prefix
																																UpperCamelCase__     :Dict							      =				merging_node.nodes
                    # If there is more than 1 edge, we just mark it as non-leaf
																						elif len(incoming_node.nodes							) > 1:
																											UpperCamelCase__     :List[str]							      =				False
																						# If there is 1 edge, we merge it with its child
																						else:
																											UpperCamelCase__     :Optional[int]							      =				list(incoming_node.nodes.values()							)[0]
																											UpperCamelCase__     :int							      =				merging_node.is_leaf
																											incoming_node.prefix += merging_node.prefix
																											UpperCamelCase__     :Optional[int]							      =				merging_node.nodes

																						return True




		def 					lowerCAmelCase__       (	self					,     UpperCamelCase_ = 0							):

							'''simple docstring'''


							if self.prefix != "":
												print('''-''' * height					,     self.prefix					,     '''  (leaf)''' if self.is_leaf else ''''''							)

							for value in self.nodes.values():
												value.print_tree(height + 1							)



def     a   (    )						->			bool:



					'''simple docstring'''






					UpperCamelCase__     :Tuple							      =				'''banana bananas bandana band apple all beast'''.split()
					UpperCamelCase__     :Tuple							      =				RadixNode()
					root.insert_many(__a     )

					assert all(root.find(__a     ) for word in words     )
					assert not root.find('''bandanas'''     )
					assert not root.find('''apps'''     )
					root.delete('''all'''     )
					assert not root.find('''all'''     )
					root.delete('''banana'''     )
					assert not root.find('''banana'''     )
					assert root.find('''bananas'''     )

					return True


def     a   (    )						->			None:



					'''simple docstring'''






					assert test_trie()


def     a   (    )						->			None:



					'''simple docstring'''






					UpperCamelCase__     :List[Any]							      =				RadixNode()
					UpperCamelCase__     :List[Any]							      =				'''banana bananas bandanas bandana band apple all beast'''.split()
					root.insert_many(__a     )

					print('''Words:'''				,      __a     )
					print('''Tree:'''     )
					root.print_tree()


if __name__ == "__main__":
		main()