"""simple docstring"""




def 							_UpperCAmelCase		(       lowerCamelCase__     ):  # noqa: E741





		"""simple docstring"""




		lowerCAmelCase__        =   len(lowerCamelCase__     )
		lowerCAmelCase__        =   0
		lowerCAmelCase__        =   [0] * n
		lowerCAmelCase__        =   [False] * n
		lowerCAmelCase__        =   [False] * n

		def dfs(lowerCamelCase__			,  lowerCamelCase__			,  lowerCamelCase__			,  lowerCamelCase__     ):
				if parent == root:
						out_edge_count += 1
				lowerCAmelCase__        =   True
				lowerCAmelCase__        =   at

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

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

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

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


# Adjacency list of graph
__lowerCAmelCase    :							str													=						{
    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 							_UpperCAmelCase		(       lowerCamelCase__     ):





		"""simple docstring"""




		assert isinstance(lowerCamelCase__			,  lowerCamelCase__     ), f"""The input value of [n={number}] is not an integer"""

		if number == 1:
				return 2
		elif number < 1:
				lowerCAmelCase__        =   f"""The input value of [n={number}] has to be > 0"""
				raise ValueError(lowerCamelCase__     )
		else:
				lowerCAmelCase__        =   sylvester(number - 1     )
				lowerCAmelCase__        =   num - 1
				lowerCAmelCase__        =   num
				return lower * upper + 1


if __name__ == "__main__":
			print(F"The 8th number in Sylvester's sequence: {sylvester(8)}")




