






import itertools
import math




def 				A		(					lowercase__  :  int  )		-> bool:

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




def 				A		(					)		-> Optional[int]:
	UpperCamelCase__ :List[str]						=      2
	while True:
		if is_prime(lowercase__  ):
			yield num
		num += 1




def 				A		(					lowercase__  :  int = 1_0001  )		-> int:
	return next(itertools.islice(prime_generator() ,		nth - 1 ,		lowercase__  )  )


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




"""simple docstring"""






from abc import ABC, abstractmethod
from argparse import ArgumentParser



class      A__  (    __SCREAMING_SNAKE_CASE				):




	'''simple docstring'''





	@staticmethod
	@abstractmethod
	def 				_SCREAMING_SNAKE_CASE  (	_SCREAMING_SNAKE_CASE:						ArgumentParser)							->			Optional[int]:

				"""simple docstring"""

				raise NotImplementedError()







	@abstractmethod
	def 				_SCREAMING_SNAKE_CASE  (	self:						Union[str, Any])							->			Dict:

				"""simple docstring"""

				raise NotImplementedError()