



'''simple docstring'''





def        lowerCamelCase  (				_snake_case  :						List[str]       ):  # noqa: E741





    '''simple docstring'''


    lowercase__		       =						len(_snake_case       )
    lowercase__		       =						0
    lowercase__		       =						[0] * n
    lowercase__		       =						[False] * n
    lowercase__		       =						[False] * n

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

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

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

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

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


# Adjacency list of graph
SCREAMING_SNAKE_CASE__      					=     {
    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'''





def        lowerCamelCase  (				_snake_case  :						int     ,_snake_case  :						int       ):





    '''simple docstring'''


    return x if y == 0 else greatest_common_divisor(_snake_case     ,x % y       )




def        lowerCamelCase  (				_snake_case  :						int     ,_snake_case  :						int       ):





    '''simple docstring'''


    return (x * y) // greatest_common_divisor(_snake_case     ,_snake_case       )




def        lowerCamelCase  (				_snake_case  :						int = 20       ):





    '''simple docstring'''


    lowercase__		       =						1
    for i in range(1     ,n + 1       ):
        lowercase__		       =						lcm(_snake_case     ,_snake_case       )
    return g


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




