


'''simple docstring'''






def   UpperCAmelCase   (		lowerCamelCase_	:Optional[Any]			):  # noqa: E741







		'''simple docstring'''
		snake_case_		:				Tuple      							=    len(__snake_case			)
		snake_case_		:				Optional[int]      							=    0
		snake_case_		:				str      							=    [0] * n
		snake_case_		:				int      							=    [False] * n
		snake_case_		:				Tuple      							=    [False] * n

		def dfs(lowerCamelCase_	:List[str]					,   lowerCamelCase_	:List[Any]					,   lowerCamelCase_	:Optional[Any]					,   lowerCamelCase_	:int			):
				if parent == root:
						out_edge_count += 1
				snake_case_		:				str      							=    True
				snake_case_		:				Tuple      							=    at

				for to in l[at]:
						if to == parent:
								pass
						elif not visited[to]:
								snake_case_		:				Optional[int]      							=    dfs(__snake_case					,   __snake_case					,   __snake_case					,   __snake_case			)
								snake_case_		:				int      							=    min(low[at]					,   low[to]			)

								# AP found via bridge
								if at < low[to]:
										snake_case_		:				Tuple      							=    True
								# AP found via cycle
								if at == low[to]:
										snake_case_		:				Optional[Any]      							=    True
						else:
								snake_case_		:				Any      							=    min(low[at]					,   __snake_case			)
				return out_edge_count

		for i in range(__snake_case			):
				if not visited[i]:
						snake_case_		:				Tuple      							=    0
						snake_case_		:				List[Any]      							=    dfs(__snake_case					,   __snake_case					,   -1					,   __snake_case			)
						snake_case_		:				Union[str, Any]      							=    out_edge_count > 1

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


# Adjacency list of graph
__A						:						Tuple  =  {
    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    :					Optional[Any]     )	->	Optional[Any]:  # noqa: E741
     __A		:					Tuple						=			len(__snake_case     )
     __A		:					Optional[int]						=			0
     __A		:					str						=			[0] * n
     __A		:					int						=			[False] * n
     __A		:					Tuple						=			[False] * n

     def dfs(__snake_case    :					List[str]					,				__snake_case    :					List[Any]					,				__snake_case    :					Optional[Any]					,				__snake_case    :					int     ):
          if parent == root:
               out_edge_count += 1
          __A		:					str						=			True
          __A		:					Tuple						=			at

          for to in l[at]:
               if to == parent:
                    pass
               elif not visited[to]:
                    __A		:					Optional[int]						=			dfs(__snake_case					,				__snake_case					,				__snake_case					,				__snake_case     )
                    __A		:					int						=			min(low[at]					,				low[to]     )

                    # AP found via bridge
                    if at < low[to]:
                         __A		:					Tuple						=			True
                    # AP found via cycle
                    if at == low[to]:
                         __A		:					Optional[Any]						=			True
               else:
                    __A		:					Any						=			min(low[at]					,				__snake_case     )
          return out_edge_count

     for i in range(__snake_case     ):
          if not visited[i]:
               __A		:					Tuple						=			0
               __A		:					List[Any]						=			dfs(__snake_case					,				__snake_case					,				-1					,				__snake_case     )
               __A		:					Union[str, Any]						=			out_edge_count > 1

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


# Adjacency list of graph
lowercase__       : Tuple         =       {
    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)