from __future__ import annotations

from typing import Generic, TypeVar

_SCREAMING_SNAKE_CASE					:  str             =      TypeVar('''T''')






class 	UpperCAmelCase__		(	Generic[T]	):






  """simple docstring"""


  def __init__(							self						:		Any     ,       __lowerCamelCase						:		T )		->							Any:
       SCREAMING_SNAKE_CASE__   =   data
       SCREAMING_SNAKE_CASE__   =   self
       SCREAMING_SNAKE_CASE__   =   0






class 	UpperCAmelCase__		(	Generic[T]	):






  """simple docstring"""


  def __init__(							self						:		int )		->							Tuple:
       SCREAMING_SNAKE_CASE__   =   {}






  def 				lowercase_		(							self						:		str     ,       __lowerCamelCase						:		T )		->							List[Any]:
       SCREAMING_SNAKE_CASE__   =   DisjointSetTreeNode(UpperCAmelCase_ )






  def 				lowercase_		(							self						:		List[Any]     ,       __lowerCamelCase						:		T )		->							str:
       SCREAMING_SNAKE_CASE__   =   self.map[data]
       if elem_ref != elem_ref.parent:
            SCREAMING_SNAKE_CASE__   =   self.find_set(elem_ref.parent.data )
       return elem_ref.parent






  def 				lowercase_		(							self						:		Tuple     ,       __lowerCamelCase						:		DisjointSetTreeNode[T]     ,       __lowerCamelCase						:		DisjointSetTreeNode[T] )		->							Optional[int]:
       # helper function for union operation
       if nodea.rank > nodea.rank:
            SCREAMING_SNAKE_CASE__   =   nodea
       else:
            SCREAMING_SNAKE_CASE__   =   nodea
            if nodea.rank == nodea.rank:
                 nodea.rank += 1







  def 				lowercase_		(							self						:		List[str]     ,       __lowerCamelCase						:		T     ,       __lowerCamelCase						:		T )		->							Optional[int]:
       self.link(self.find_set(UpperCAmelCase_ )     ,       self.find_set(UpperCAmelCase_ ) )






class 	UpperCAmelCase__		(	Generic[T]	):






  """simple docstring"""


  def __init__(							self						:		Tuple )		->							List[Any]:
       SCREAMING_SNAKE_CASE__   =   {}






  def 				lowercase_		(							self						:		List[Any]     ,       __lowerCamelCase						:		T )		->							str:
       # add a node ONLY if its not present in the graph
       if node not in self.connections:
            SCREAMING_SNAKE_CASE__   =   {}






  def 				lowercase_		(							self						:		Any     ,       __lowerCamelCase						:		T     ,       __lowerCamelCase						:		T     ,       __lowerCamelCase						:		int )		->							Optional[int]:
       self.add_node(UpperCAmelCase_ )
       self.add_node(UpperCAmelCase_ )
       SCREAMING_SNAKE_CASE__   =   weight
       SCREAMING_SNAKE_CASE__   =   weight







  def 				lowercase_		(							self						:		List[str] )		->							Dict:
       SCREAMING_SNAKE_CASE__   =   []
       SCREAMING_SNAKE_CASE__   =   set()
       for start in self.connections:
            for end in self.connections[start]:
                 if (start, end) not in seen:
                      seen.add((end, start) )
                      edges.append((start, end, self.connections[start][end]) )
       edges.sort(key=lambda __lowerCamelCase : x[2] )

       # creating the disjoint set
       SCREAMING_SNAKE_CASE__   =   DisjointSetTree[T]()
       for node in self.connections:
            disjoint_set.make_set(UpperCAmelCase_ )

       # MST generation
       SCREAMING_SNAKE_CASE__   =   0
       SCREAMING_SNAKE_CASE__   =   0
       SCREAMING_SNAKE_CASE__   =   GraphUndirectedWeighted[T]()
       while num_edges < len(self.connections ) - 1:
            SCREAMING_SNAKE_CASE__   =   edges[index]
            index += 1
            SCREAMING_SNAKE_CASE__   =   disjoint_set.find_set(UpperCAmelCase_ )
            SCREAMING_SNAKE_CASE__   =   disjoint_set.find_set(UpperCAmelCase_ )
            if parent_u != parent_v:
                 num_edges += 1
                 graph.add_edge(UpperCAmelCase_     ,       UpperCAmelCase_     ,       UpperCAmelCase_ )
                 disjoint_set.union(UpperCAmelCase_     ,       UpperCAmelCase_ )
       return graph





from functools import reduce

_SCREAMING_SNAKE_CASE					:  Any             =      (
    '''73167176531330624919225119674426574742355349194934'''
    '''96983520312774506326239578318016984801869478851843'''
    '''85861560789112949495459501737958331952853208805511'''
    '''12540698747158523863050715693290963295227443043557'''
    '''66896648950445244523161731856403098711121722383113'''
    '''62229893423380308135336276614282806444486645238749'''
    '''30358907296290491560440772390713810515859307960866'''
    '''70172427121883998797908792274921901699720888093776'''
    '''65727333001053367881220235421809751254540594752243'''
    '''52584907711670556013604839586446706324415722155397'''
    '''53697817977846174064955149290862569321978468622482'''
    '''83972241375657056057490261407972968652414535100474'''
    '''82166370484403199890008895243450658541227588666881'''
    '''16427171479924442928230863465674813919123162824586'''
    '''17866458359124566529476545682848912883142607690042'''
    '''24219022671055626321111109370544217506941658960408'''
    '''07198403850962455444362981230987879927244284909188'''
    '''84580156166097919133875499200524063689912560717606'''
    '''05886116467109405077541002256983155200055935729725'''
    '''71636269561882670428252483600823257530420752963450'''
)
def     UpperCAmelCase_       (						_A = N    ):





     '''simple docstring'''




     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() = }")


