





'''simple docstring'''


import itertools
import math







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







def    _lowerCamelCase  ()   ->    Union[str, Any]:
			a__     = 2
			while True:
						if is_prime(__lowerCamelCase     ):
									yield num
						num += 1







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


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










'''simple docstring'''


import unittest

from accelerate import debug_launcher
from accelerate.test_utils import require_cpu, test_ops, test_script






@require_cpu
class       UpperCamelCase__  (		unittest.TestCase     ):







	def 						__a   (				self			:   List[str]		):




				'''simple docstring'''
				debug_launcher(test_script.main		)







	def 						__a   (				self			:   Dict		):




				'''simple docstring'''
				debug_launcher(test_ops.main		)



