


'''simple docstring'''






def 	_A				(lowerCAmelCase__  :List[str]		)   ->  int:  # noqa: E741




     '''simple docstring'''



     _a			      =							len(lowerCAmelCase__		)
     _a			      =							0
     _a			      =							[0] * n
     _a			      =							[False] * n
     _a			      =							[False] * n

     def dfs(lowerCAmelCase__  :Tuple				,						lowerCAmelCase__  :List[str]				,						lowerCAmelCase__  :Tuple				,						lowerCAmelCase__  :Optional[int]		):
          if parent == root:
               out_edge_count += 1
          _a			      =							True
          _a			      =							at

          for to in l[at]:
               if to == parent:
                    pass
               elif not visited[to]:
                    _a			      =							dfs(lowerCAmelCase__				,						lowerCAmelCase__				,						lowerCAmelCase__				,						lowerCAmelCase__		)
                    _a			      =							min(low[at]				,						low[to]		)

                    # AP found via bridge
                    if at < low[to]:
                         _a			      =							True
                    # AP found via cycle
                    if at == low[to]:
                         _a			      =							True
               else:
                    _a			      =							min(low[at]				,						lowerCAmelCase__		)
          return out_edge_count

     for i in range(lowerCAmelCase__		):
          if not visited[i]:
               _a			      =							0
               _a			      =							dfs(lowerCAmelCase__				,						lowerCAmelCase__				,						-1				,						lowerCAmelCase__		)
               _a			      =							out_edge_count > 1

     for x in range(len(lowerCAmelCase__		)		):
          if is_art[x] is True:
               print(lowerCAmelCase__		)


# Adjacency list of graph
a_					:    int          =    {
    0: [1, 2],
    1: [0, 2],
    2: [0, 1, 3, 5],
    3: [2, 4],
    4: [3],
    5: [2, 6, 8],
    6: [5, 7],
    7: [6, 8],
    8: [5, 7],
}






compute_ap(data)





'''simple docstring'''






from functools import reduce

a_					:    Any          =    (
    "73167176531330624919225119674426574742355349194934"
    "96983520312774506326239578318016984801869478851843"
    "85861560789112949495459501737958331952853208805511"
    "12540698747158523863050715693290963295227443043557"
    "66896648950445244523161731856403098711121722383113"
    "62229893423380308135336276614282806444486645238749"
    "30358907296290491560440772390713810515859307960866"
    "70172427121883998797908792274921901699720888093776"
    "65727333001053367881220235421809751254540594752243"
    "52584907711670556013604839586446706324415722155397"
    "53697817977846174064955149290862569321978468622482"
    "83972241375657056057490261407972968652414535100474"
    "82166370484403199890008895243450658541227588666881"
    "16427171479924442928230863465674813919123162824586"
    "17866458359124566529476545682848912883142607690042"
    "24219022671055626321111109370544217506941658960408"
    "07198403850962455444362981230987879927244284909188"
    "84580156166097919133875499200524063689912560717606"
    "05886116467109405077541002256983155200055935729725"
    "71636269561882670428252483600823257530420752963450"
)






def 	_A				(lowerCAmelCase__  :str = N		)   ->  int:




     '''simple docstring'''



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


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

