


from functools import reduce

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



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


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






from __future__ import annotations

_A		:				List[str]									=       {
    '''A''': ['''B''', '''C''', '''E'''],
    '''B''': ['''A''', '''D''', '''E'''],
    '''C''': ['''A''', '''F''', '''G'''],
    '''D''': ['''B'''],
    '''E''': ['''A''', '''B''', '''D'''],
    '''F''': ['''C'''],
    '''G''': ['''C'''],
}



class        a					:





     def __init__(    self					:				Any    ,	SCREAMING_SNAKE_CASE_					:				dict[str, list[str]]    ,	SCREAMING_SNAKE_CASE_					:				str							):
        __lowerCamelCase:				Dict     =	graph
        # mapping node to its parent in resulting breadth first tree
        __lowerCamelCase:				dict[str, str | None]     =	{}
        __lowerCamelCase:				str     =	source_vertex





     def  SCREAMING_SNAKE_CASE__       (    self					:				int							):
        __lowerCamelCase:				Optional[int]     =	{self.source_vertex}
        __lowerCamelCase:				Optional[int]     =	None
        __lowerCamelCase:				Optional[int]     =	[self.source_vertex]  # first in first out queue

        while queue:
           __lowerCamelCase:				int     =	queue.pop(0							)
           for adjacent_vertex in self.graph[vertex]:
              if adjacent_vertex not in visited:
                 visited.add(SCREAMING_SNAKE_CASE_							)
                 __lowerCamelCase:				Dict     =	vertex
                 queue.append(SCREAMING_SNAKE_CASE_							)







     def  SCREAMING_SNAKE_CASE__       (    self					:				Optional[Any]    ,	SCREAMING_SNAKE_CASE_					:				str							):
        if target_vertex == self.source_vertex:
           return self.source_vertex

        __lowerCamelCase:				List[str]     =	self.parent.get(SCREAMING_SNAKE_CASE_							)
        if target_vertex_parent is None:
           __lowerCamelCase:				Optional[int]     =	(
               F'No path from vertex: {self.source_vertex} to vertex: {target_vertex}'
           )
           raise ValueError(SCREAMING_SNAKE_CASE_							)

        return self.shortest_path(SCREAMING_SNAKE_CASE_							) + F'->{target_vertex}'


if __name__ == "__main__":
   _A		:				int									=       Graph(graph, '''G''')
   g.breath_first_search()
   print(g.shortest_path('''D'''))
   print(g.shortest_path('''G'''))
   print(g.shortest_path('''Foo'''))


