



import itertools
import math





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





def 					__snake_case     (      ):
    __a							=    2
    while True:
        if is_prime(_UpperCAmelCase    ):
            yield num
        num += 1





def 					__snake_case     (      _UpperCAmelCase = 10001    ):
    return next(itertools.islice(prime_generator()       ,			nth - 1       ,			_UpperCAmelCase    )    )


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










def 					__snake_case     (      _UpperCAmelCase    ):
    if not isinstance(_UpperCAmelCase       ,			_UpperCAmelCase    ):
        raise TypeError('''Input value must be an \'int\' type'''    )

    __a							=    0
    while number:
        position += 1
        number >>= 1

    return position


if __name__ == "__main__":
 import doctest

 doctest.testmod()





