


def 					lowerCamelCase_   (	_a	):  # noqa: E741




		"""simple docstring"""






		lowerCAmelCase__       :      Tuple   					= len(lowerCamelCase__	)
		lowerCAmelCase__       :      int   					= 0
		lowerCAmelCase__       :      Optional[Any]   					= [0] * n
		lowerCAmelCase__       :      str   					= [False] * n
		lowerCAmelCase__       :      List[str]   					= [False] * n

		def dfs(_a     ,       _a     ,       _a     ,       _a	):
				if parent == root:
						out_edge_count += 1
				lowerCAmelCase__       :      Any   					= True
				lowerCAmelCase__       :      Optional[int]   					= at

				for to in l[at]:
						if to == parent:
								pass
						elif not visited[to]:
								lowerCAmelCase__       :      Union[str, Any]   					= dfs(lowerCamelCase__     ,       lowerCamelCase__     ,       lowerCamelCase__     ,       lowerCamelCase__	)
								lowerCAmelCase__       :      List[Any]   					= min(low[at]     ,       low[to]	)

								# AP found via bridge
								if at < low[to]:
										lowerCAmelCase__       :      Dict   					= True
								# AP found via cycle
								if at == low[to]:
										lowerCAmelCase__       :      Optional[int]   					= True
						else:
								lowerCAmelCase__       :      Tuple   					= min(low[at]     ,       lowerCamelCase__	)
				return out_edge_count

		for i in range(lowerCamelCase__	):
				if not visited[i]:
						lowerCAmelCase__       :      List[Any]   					= 0
						lowerCAmelCase__       :      str   					= dfs(lowerCamelCase__     ,       lowerCamelCase__     ,       -1     ,       lowerCamelCase__	)
						lowerCAmelCase__       :      Dict   					= out_edge_count > 1

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


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








def 					lowerCamelCase_   (	_a = 4_000_000	):




		"""simple docstring"""






		lowerCAmelCase__       :      str   					= []
		lowerCAmelCase__					,     lowerCAmelCase__       :      Optional[Any]   					= 0, 1
		while b <= n:
				if b % 2 == 0:
						even_fibs.append(_a	)
				lowerCAmelCase__					,     lowerCAmelCase__       :      Union[str, Any]   					= b, a + b
		return sum(_a	)


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




