




import math



def       UpperCAmelCase__  (     lowerCamelCase   ):

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



def       UpperCAmelCase__  (     lowerCamelCase = 10001   ):

  try:
    lowercase    :Any      	=						int(lowerCamelCase   )
  except (TypeError, ValueError):
    raise TypeError("Parameter nth must be int or castable to int."   ) from None
  if nth <= 0:
    raise ValueError("Parameter nth must be greater than or equal to one."   )
  lowercase    :List[str]      	=						[]
  lowercase    :int      	=						2
  while len(lowerCamelCase   ) < nth:
    if is_prime(lowerCamelCase   ):
      primes.append(lowerCamelCase   )
      num += 1
    else:
      num += 1
  return primes[len(lowerCamelCase   ) - 1]


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









def       UpperCAmelCase__  (     lowerCamelCase   ):
  if divisor % 5 == 0 or divisor % 2 == 0:
    return 0
  lowercase    :str      	=						1
  lowercase    :Tuple      	=						1
  while repunit:
    lowercase    :Dict      	=						(10 * repunit + 1) % divisor
    repunit_index += 1
  return repunit_index



def       UpperCAmelCase__  (     lowerCamelCase = 1000000   ):
  lowercase    :List[Any]      	=						limit - 1
  if divisor % 2 == 0:
    divisor += 1
  while least_divisible_repunit(lowerCamelCase   ) <= limit:
    divisor += 2
  return divisor


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



