


"""simple docstring"""



import itertools
import math







def   __lowerCAmelCase						(						lowercase  :  int )	->						bool:


    """simple docstring"""





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







def   __lowerCAmelCase						(						)	->						Optional[int]:


    """simple docstring"""





    snake_case    :      Union[str, Any]      					=    2
    while True:
        if is_prime(lowercase ):
            yield num
        num += 1







def   __lowerCAmelCase						(						lowercase  :  int = 1_0001 )	->						int:


    """simple docstring"""





    return next(itertools.islice(prime_generator()						,							nth - 1						,							lowercase ) )


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









"""simple docstring"""



def   __lowerCAmelCase						(						)	->						Union[str, Any]:


    """simple docstring"""





    snake_case    :      Dict      					=    []
    snake_case    :      List[Any]      					=    1

    while len(lowercase ) < 1e6:
        constant.append(str(lowercase ) )
        i += 1

    snake_case    :      Tuple      					=    "".join(lowercase )

    return (
        int(constant[0] )
        * int(constant[9] )
        * int(constant[99] )
        * int(constant[999] )
        * int(constant[9999] )
        * int(constant[9_9999] )
        * int(constant[99_9999] )
    )


if __name__ == "__main__":
  print(solution())





