





"""simple docstring"""



def 		__lowercase     (   snake_case_  :  int				,snake_case_  :  int						)   ->int:



    '''simple docstring'''







    return abs(snake_case_						) if a == 0 else greatest_common_divisor(b % a				,snake_case_						)







def 		__lowercase     (   snake_case_  :  int				,snake_case_  :  int						)   ->int:



    '''simple docstring'''







    while y:  # --> when y=0 then loop will terminate and return x as final GCD.
        __A ,       __A    :						Union[str, Any]						 =     y, x % y
    return abs(snake_case_						)







def 		__lowercase     (   )   ->Any:



    '''simple docstring'''







    try:
        __A    :						Any						 =     input('''Enter two integers separated by comma (,): '''						).split(''','''						)
        __A    :						int						 =     int(nums[0]						)
        __A    :						Any						 =     int(nums[1]						)
        print(
            F"""greatest_common_divisor({num_a}, {num_a}) = """
            F"""{greatest_common_divisor(snake_case_				,snake_case_						)}"""						)
        print(F"""By iterative gcd({num_a}, {num_a}) = {gcd_by_iterative(snake_case_				,snake_case_						)}"""						)
    except (IndexError, UnboundLocalError, ValueError):
        print('''Wrong input'''						)


if __name__ == "__main__":
       main()











"""simple docstring"""



def 		__lowercase     (   snake_case_  :  dict						)   ->set:



    '''simple docstring'''







    __A    :						List[str]						 =     set()
    # edges = list of graph's edges
    __A    :						Optional[int]						 =     get_edges(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:
        __A ,       __A    :						str						 =     edges.pop()
        chosen_vertices.add(snake_case_						)
        chosen_vertices.add(snake_case_						)
        for edge in edges.copy():
            if from_node in edge or to_node in edge:
                edges.discard(snake_case_						)
    return chosen_vertices







def 		__lowercase     (   snake_case_  :  dict						)   ->set:



    '''simple docstring'''







    __A    :						Tuple						 =     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)}")




