





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







def    A				(							):
					_snake_case       :					List[Any]				       =   2
					while True:
										if is_prime(SCREAMING_SNAKE_CASE_				):
															yield num
										num += 1







def    A				(							UpperCAmelCase = 10_001				):
					return next(itertools.islice(prime_generator()  ,  nth - 1  ,  SCREAMING_SNAKE_CASE_				)				)


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






import math

from numpy import inf
from scipy.integrate import quad







def    A				(							UpperCAmelCase				):
					if num <= 0:
										raise ValueError("math domain error"				)

					return quad(UpperCAmelCase  ,  0  ,  UpperCAmelCase  ,  args=(UpperCAmelCase)				)[0]







def    A				(							UpperCAmelCase  ,  UpperCAmelCase				):
					return math.pow(UpperCAmelCase  ,  z - 1				) * math.exp(-x				)


if __name__ == "__main__":
							from doctest import testmod

							testmod()