


from math import sqrt






def 						a__			(				A__				):

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






def 						a__			(				A__ = 1_0_0_0_1				):
			SCREAMING_SNAKE_CASE_		:     List[Any]					=					0
			SCREAMING_SNAKE_CASE_		:     Optional[int]					=					1
			while count != nth and number < 3:
						number += 1
						if is_prime(A__				):
									count += 1
			while count != nth:
						number += 2
						if is_prime(A__				):
									count += 1
			return number


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









def 							UpperCamelCase_(					_A :Union[str, Any]	)->		List[str]:
			UpperCamelCase__       =							[0] * len(_A	)
			UpperCamelCase__       =							[]
			UpperCamelCase__       =							[]
			UpperCamelCase__       =							0

			for values in graph.values():
						for i in values:
									indegree[i] += 1

			for i in range(len(_A	)	):
						if indegree[i] == 0:
									queue.append(_A	)

			while queue:
						UpperCamelCase__       =							queue.pop(0	)
						cnt += 1
						topo.append(_A	)
						for x in graph[vertex]:
									indegree[x] -= 1
									if indegree[x] == 0:
												queue.append(_A	)

			if cnt != len(_A	):
						print("Cycle exists"	)
			else:
						print(_A	)


# Adjacency List of Graph
__UpperCamelCase     		=							{0: [1, 2], 1: [3], 2: [3], 3: [4, 5], 4: [], 5: []}







topological_sort(graph)


