




from functools import reduce

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







def lowerCamelCase__  (     _lowercase = N ):

     '''simple docstring'''


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


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





'''simple docstring'''





from __future__ import annotations

from typing import Any

class   _a							:






     def __init__(					self   ,_SCREAMING_SNAKE_CASE       )				->     None:
          _snake_case				= num_of_nodes
          _snake_case				= []
          _snake_case				= {}






     def 							_lowercase      (					self   ,_SCREAMING_SNAKE_CASE   ,_SCREAMING_SNAKE_CASE   ,_SCREAMING_SNAKE_CASE       )				->     None:
          self.m_edges.append([u_node, v_node, weight]       )






     def 							_lowercase      (					self   ,_SCREAMING_SNAKE_CASE       )				->     int:

          if self.m_component[u_node] == u_node:
               return u_node
          return self.find_component(self.m_component[u_node]       )






     def 							_lowercase      (					self   ,_SCREAMING_SNAKE_CASE       )				->     None:

          if self.m_component[u_node] != u_node:
               for k in self.m_component:
                    _snake_case				= self.find_component(_SCREAMING_SNAKE_CASE       )






     def 							_lowercase      (					self   ,_SCREAMING_SNAKE_CASE   ,_SCREAMING_SNAKE_CASE   ,_SCREAMING_SNAKE_CASE       )				->     None:

          if component_size[u_node] <= component_size[v_node]:
               _snake_case				= v_node
               component_size[v_node] += component_size[u_node]
               self.set_component(_SCREAMING_SNAKE_CASE       )

          elif component_size[u_node] >= component_size[v_node]:
               _snake_case				= self.find_component(_SCREAMING_SNAKE_CASE       )
               component_size[u_node] += component_size[v_node]
               self.set_component(_SCREAMING_SNAKE_CASE       )






     def 							_lowercase      (					self       )				->     None:
          _snake_case				= []
          _snake_case				= 0

          _snake_case				= [-1] * self.m_num_of_nodes

          # A list of components (initialized to all of the nodes)
          for node in range(self.m_num_of_nodes       ):
               self.m_component.update({node: node}       )
               component_size.append(1       )

          _snake_case				= self.m_num_of_nodes

          while num_of_components > 1:
               for edge in self.m_edges:
                    _snake_case				,   _snake_case				,   _snake_case				= edge

                    _snake_case				= self.m_component[u]
                    _snake_case				= self.m_component[v]

                    if u_component != v_component:

                         for component in (u_component, v_component):
                              if (
                                  minimum_weight_edge[component] == -1
                                  or minimum_weight_edge[component][2] > w
                              ):
                                   _snake_case				= [u, v, w]

               for edge in minimum_weight_edge:
                    if isinstance(_SCREAMING_SNAKE_CASE   ,_SCREAMING_SNAKE_CASE       ):
                         _snake_case				,   _snake_case				,   _snake_case				= edge

                         _snake_case				= self.m_component[u]
                         _snake_case				= self.m_component[v]

                         if u_component != v_component:
                              mst_weight += w
                              self.union(_SCREAMING_SNAKE_CASE   ,_SCREAMING_SNAKE_CASE   ,_SCREAMING_SNAKE_CASE       )
                              print(f"""Added edge [{u} - {v}]\nAdded weight: {w}\n"""       )
                              num_of_components -= 1

               _snake_case				= [-1] * self.m_num_of_nodes
          print(f"""The total weight of the minimal spanning tree is: {mst_weight}"""       )







def       __a      (  )		->					None:

     """simple docstring"""






if __name__ == "__main__":
   import doctest

   doctest.testmod()


