




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 		snake_case_							(_a			:							str = N  ):
    return max(
        # mypy cannot properly interpret reduce
        int(reduce(lambda _a					,     _a  : str(int(_a  ) * int(_a  )  )					,     n[i : i + 1_3]  )  )
        for i in range(len(_a  ) - 1_2  )  )


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










'''simple docstring'''







def 		snake_case_							(_a			:							list[list[int]]					,     _a			:							int					,     _a			:							int					,     _a			:							list[int]  ):

    # 1. Validate that path exists between current and next vertices
    if graph[path[curr_ind - 1]][next_ver] == 0:
        return False

    # 2. Validate that next vertex is not already in path
    return not any(vertex == next_ver for vertex in path  )





def 		snake_case_							(_a			:							list[list[int]]					,     _a			:							list[int]					,     _a			:							int  ):

    # Base Case
    if curr_ind == len(_a  ):
        # return whether path exists between current and starting vertices
        return graph[path[curr_ind - 1]][path[0]] == 1

    # Recursive Step
    for next_ver in range(0					,     len(_a  )  ):
        if valid_connection(_a					,     _a					,     _a					,     _a  ):
            # Insert current vertex  into path as next transition
            UpperCAmelCase     =	next_ver
            # Validate created path
            if util_hamilton_cycle(_a					,     _a					,     curr_ind + 1  ):
                return True
            # Backtrack
            UpperCAmelCase     =	-1
    return False







def 		snake_case_							(_a			:							list[list[int]]					,     _a			:							int = 0  ):
    UpperCAmelCase     =	[-1] * (len(_a  ) + 1)
    # initialize start and end of path with starting index
    UpperCAmelCase     =	UpperCAmelCase     =	start_index
    # evaluate and if we find answer return path either return empty array
    return path if util_hamilton_cycle(_a					,     _a					,     1  ) else []




