



"""simple docstring"""
from math import sqrt





def  lowerCamelCase_						(UpperCamelCase__		:		int							):

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





def  lowerCamelCase_						(UpperCamelCase__		:		int = 1_0001							):
    _UpperCAmelCase							:  Any											=    0
    _UpperCAmelCase							:  Tuple											=    1
    while count != nth and number < 3:
        number += 1
        if is_prime(UpperCamelCase__							):
            count += 1
    while count != nth:
        number += 2
        if is_prime(UpperCamelCase__							):
            count += 1
    return number


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







"""simple docstring"""
import math

from numpy import inf
from scipy.integrate import quad





def  lowerCamelCase_						(UpperCamelCase__		:		float							):
    if num <= 0:
        raise ValueError('''math domain error'''							)

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





def  lowerCamelCase_						(UpperCamelCase__		:		float     ,       UpperCamelCase__		:		float							):
    return math.pow(UpperCamelCase__     ,       z - 1							) * math.exp(-x							)


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

  testmod()


