






from collections import deque





def 				snake_case  (     lowerCamelCase					):




				'''simple docstring'''







				__lowercase             =  len(lowerCamelCase					)
				__lowercase             =  deque()
				__lowercase             =  [False for _ in range(lowerCamelCase					)]
				__lowercase             =  [-1 for _ in range(lowerCamelCase					)]
				__lowercase             =  index_of[:]

				def strong_connect(lowerCamelCase				,  lowerCamelCase				,  lowerCamelCase					):
								__lowercase             =  index  # the number when this node is seen
								__lowercase             =  index  # lowest rank node reachable from here
								index += 1
								stack.append(lowerCamelCase					)
								__lowercase             =  True

								for w in g[v]:
												if index_of[w] == -1:
																__lowercase             =  strong_connect(lowerCamelCase				,  lowerCamelCase				,  lowerCamelCase					)
																__lowercase             =  (
																    lowlink_of[w] if lowlink_of[w] < lowlink_of[v] else lowlink_of[v]
																)
												elif on_stack[w]:
																__lowercase             =  (
																    lowlink_of[w] if lowlink_of[w] < lowlink_of[v] else lowlink_of[v]
																)

								if lowlink_of[v] == index_of[v]:
												__lowercase             =  []
												__lowercase             =  stack.pop()
												__lowercase             =  False
												component.append(lowerCamelCase					)
												while w != v:
																__lowercase             =  stack.pop()
																__lowercase             =  False
																component.append(lowerCamelCase					)
												components.append(lowerCamelCase					)
								return index

				__lowercase             =  []
				for v in range(lowerCamelCase					):
								if index_of[v] == -1:
												strong_connect(lowerCamelCase				,  0				,  lowerCamelCase					)

				return components





def 				snake_case  (     lowerCamelCase				,  lowerCamelCase					):




				'''simple docstring'''







				__lowercase             =  [[] for _ in range(lowerCamelCase					)]
				for u, v in edges:
								g[u].append(lowerCamelCase					)
				return g


if __name__ == "__main__":
						# Test
						__UpperCamelCase      :      str     						=						7
						__UpperCamelCase      :      Union[str, Any]     						=						[0, 0, 1, 2, 3, 3, 4, 4, 6]
						__UpperCamelCase      :      str     						=						[1, 3, 2, 0, 1, 4, 5, 6, 5]
						__UpperCamelCase      :      List[Any]     						=						[(u, v) for u, v in zip(source, target)]
						__UpperCamelCase      :      Any     						=						create_graph(n_vertices, edges)

						assert [[5], [6], [4], [3, 2, 1, 0]] == tarjan(g)









from math import sqrt





def 				snake_case  (     lowerCamelCase					):




	'''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(lowerCamelCase					) + 1					)				,  6					):
		if number % i == 0 or number % (i + 2) == 0:
			return False
	return True





def 				snake_case  (     lowerCamelCase = 10_001					):




	'''simple docstring'''







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


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

