




import itertools
import math
def 					_A	(		SCREAMING_SNAKE_CASE					:       int						):





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





  """simple docstring"""



  a__     : str  =2
  while True:
    if is_prime(SCREAMING_SNAKE_CASE						):
      yield num
    num += 1
def 					_A	(		SCREAMING_SNAKE_CASE					:       int = 10_001						):





  """simple docstring"""



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


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













def 					_A	(		SCREAMING_SNAKE_CASE					:       int = 1	,	SCREAMING_SNAKE_CASE					:       int = 1_000						):





  """simple docstring"""



  a__     : Any  =1
  a__     : Any  =0

  for divide_by_number in range(SCREAMING_SNAKE_CASE	,	digit + 1						):
    a__     : list[int]  =[]
    a__     : int  =numerator
    for _ in range(1	,	digit + 1						):
      if now_divide in has_been_divided:
        if longest_list_length < len(SCREAMING_SNAKE_CASE						):
          a__     : Optional[Any]  =len(SCREAMING_SNAKE_CASE						)
          a__     : List[str]  =divide_by_number
      else:
        has_been_divided.append(SCREAMING_SNAKE_CASE						)
        a__     : List[Any]  =now_divide * 10 % divide_by_number

  return the_digit


# Tests
if __name__ == "__main__":
     import doctest

     doctest.testmod()






