



def   lowerCAmelCase__						(							_SCREAMING_SNAKE_CASE       :			List[Any]    ):  # noqa: E741
				"""simple docstring"""







				__a       =		len(_SCREAMING_SNAKE_CASE    )
				__a       =		0
				__a       =		[0] * n
				__a       =		[False] * n
				__a       =		[False] * n

				def dfs(_SCREAMING_SNAKE_CASE       :			Tuple				,     _SCREAMING_SNAKE_CASE       :			str				,     _SCREAMING_SNAKE_CASE       :			Optional[Any]				,     _SCREAMING_SNAKE_CASE       :			Union[str, Any]    ):
								if parent == root:
												out_edge_count += 1
								__a       =		True
								__a       =		at

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

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

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

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


# 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)





from math import sqrt

def   lowerCAmelCase__						(							_SCREAMING_SNAKE_CASE       :			int    ):
				"""simple docstring"""







				if 1 < number < 4:
								# 2 and 3 are primes
								return True
				elif number < 2 or number % 2 == 0 or number % 3 == 0:
								# Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
								return False

				# All primes number are in format of 6k +/- 1
				for i in range(5				,     int(sqrt(_SCREAMING_SNAKE_CASE    ) + 1    )				,     6    ):
								if number % i == 0 or number % (i + 2) == 0:
												return False
				return True

def   lowerCAmelCase__						(							_SCREAMING_SNAKE_CASE       :			int = 1_0001    ):
				"""simple docstring"""







				__a       =		0
				__a       =		1
				while count != nth and number < 3:
								number += 1
								if is_prime(_SCREAMING_SNAKE_CASE    ):
												count += 1
				while count != nth:
								number += 2
								if is_prime(_SCREAMING_SNAKE_CASE    ):
												count += 1
				return number


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