





from math import sqrt

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

def   __snake_case    (       _lowerCAmelCase			:			int = 10001						)			->    int:
   A_       :					Any        =      0
   A_       :					Tuple        =      1
   while count != nth and number < 3:
      number += 1
      if is_prime(_lowerCAmelCase						):
         count += 1
   while count != nth:
      number += 2
      if is_prime(_lowerCAmelCase						):
         count += 1
   return number


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







def   __snake_case    (       _lowerCAmelCase			:			int = 1					,					_lowerCAmelCase			:			int = 1000						)			->    int:
   A_       :					Optional[int]        =      1
   A_       :					int        =      0

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

   return the_digit


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

 doctest.testmod()
