




import math

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

def 	A ( _SCREAMING_SNAKE_CASE = 1_0001       )      ->					int:

       try:
              lowerCamelCase  : Optional[Any]     					=   int(__UpperCAmelCase       )
       except (TypeError, ValueError):
              raise TypeError("Parameter nth must be int or castable to int."       ) from None
       if nth <= 0:
              raise ValueError("Parameter nth must be greater than or equal to one."       )
       lowerCamelCase  : Optional[Any]     					=   []
       lowerCamelCase  : Dict     					=   2
       while len(__UpperCAmelCase       ) < nth:
              if is_prime(__UpperCAmelCase       ):
                     primes.append(__UpperCAmelCase       )
                     num += 1
              else:
                     num += 1
       return primes[len(__UpperCAmelCase       ) - 1]


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












'''simple docstring'''

from numpy import exp, pi, sqrt


def 						__magic_name__       (      __UpperCAmelCase, __UpperCAmelCase = 0.0, __UpperCAmelCase = 1.0      )						->   int:

					'''simple docstring'''

					return 1 / sqrt(2 * pi * sigma**2      ) * exp(-((x - mu) ** 2) / (2 * sigma**2)      )


if __name__ == "__main__":
							import doctest

							doctest.testmod()

