



'''simple docstring'''
import itertools
import math






def A__   (					UpperCAmelCase_							):

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






def A__   (					):
						_UpperCamelCase :		Optional[int]			    =       2
						while True:
												if is_prime(UpperCAmelCase_							):
																		yield num
												num += 1






def A__   (					UpperCAmelCase_ = 1_0_0_0_1							):
						return next(itertools.islice(prime_generator()  ,  nth - 1  ,  UpperCAmelCase_							)							)


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







'''simple docstring'''
from abc import ABC, abstractmethod
from argparse import ArgumentParser






class 							lowercase__     (							lowercase       ):





	@staticmethod
	@abstractmethod
	def      UpperCamelCase_  (			lowerCamelCase__ :    ArgumentParser			):







							'''simple docstring'''
							raise NotImplementedError()





	@abstractmethod
	def      UpperCamelCase_  (			self :    Any			):







							'''simple docstring'''
							raise NotImplementedError()


