
def  snake_case_		(    __SCREAMING_SNAKE_CASE :			dict							):



						"""simple docstring"""





						lowercase_     :					Optional[int]													=	set()
						# edges = list of graph's edges
						lowercase_     :					Union[str, Any]													=	get_edges(__SCREAMING_SNAKE_CASE							)

						# While there are still elements in edges list, take an arbitrary edge
						# (from_node, to_node) and add his extremity to chosen_vertices and then
						# remove all arcs adjacent to the from_node and to_node
						while edges:
												lowercase_     :					Dict													=	edges.pop()
												chosen_vertices.add(__SCREAMING_SNAKE_CASE							)
												chosen_vertices.add(__SCREAMING_SNAKE_CASE							)
												for edge in edges.copy():
																		if from_node in edge or to_node in edge:
																								edges.discard(__SCREAMING_SNAKE_CASE							)
						return chosen_vertices
def  snake_case_		(    __SCREAMING_SNAKE_CASE :			dict							):



						"""simple docstring"""





						lowercase_     :					str													=	set()
						for from_node, to_nodes in graph.items():
												for to_node in to_nodes:
																		edges.add((from_node, to_node)							)
						return edges


if __name__ == "__main__":
							import doctest

							doctest.testmod()

							# graph = {0: [1, 3], 1: [0, 3], 2: [0, 3, 4], 3: [0, 1, 2], 4: [2, 3]}
							# print(f"Matching vertex cover:\n{matching_min_vertex_cover(graph)}")





'''simple docstring'''







import sys

_lowercase			:  Union[str, Any]   							=	(
    "73167176531330624919225119674426574742355349194934"
    "96983520312774506326239578318016984801869478851843"
    "85861560789112949495459501737958331952853208805511"
    "12540698747158523863050715693290963295227443043557"
    "66896648950445244523161731856403098711121722383113"
    "62229893423380308135336276614282806444486645238749"
    "30358907296290491560440772390713810515859307960866"
    "70172427121883998797908792274921901699720888093776"
    "65727333001053367881220235421809751254540594752243"
    "52584907711670556013604839586446706324415722155397"
    "53697817977846174064955149290862569321978468622482"
    "83972241375657056057490261407972968652414535100474"
    "82166370484403199890008895243450658541227588666881"
    "16427171479924442928230863465674813919123162824586"
    "17866458359124566529476545682848912883142607690042"
    "24219022671055626321111109370544217506941658960408"
    "07198403850962455444362981230987879927244284909188"
    "84580156166097919133875499200524063689912560717606"
    "05886116467109405077541002256983155200055935729725"
    "71636269561882670428252483600823257530420752963450"
)
def  snake_case_		(    __SCREAMING_SNAKE_CASE :			str							):



						"""simple docstring"""





						lowercase_     :					Any													=	1
						for digit in s:
												product *= int(__SCREAMING_SNAKE_CASE							)
						return product
def  snake_case_		(    __SCREAMING_SNAKE_CASE :			str = N							):



						"""simple docstring"""





						lowercase_     :					Any													=	-sys.maxsize - 1
						lowercase_     :					List[Any]													=	n[:13]
						lowercase_     :					List[str]													=	13
						while cur_index < len(__SCREAMING_SNAKE_CASE							) - 13:
												if int(n[cur_index]							) >= int(substr[0]							):
																		lowercase_     :					Tuple													=	substr[1:] + n[cur_index]
																		cur_index += 1
												else:
																		lowercase_     :					str													=	max(__SCREAMING_SNAKE_CASE				,				str_eval(__SCREAMING_SNAKE_CASE							)							)
																		lowercase_     :					List[Any]													=	n[cur_index : cur_index + 13]
																		cur_index += 13
						return largest_product


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



