





def     SCREAMING_SNAKE_CASE			(      lowerCAmelCase					):


       if divisor % 5 == 0 or divisor % 2 == 0:
              return 0
       _UpperCamelCase              =						1
       _UpperCamelCase              =						1
       while repunit:
              _UpperCamelCase              =						(10 * repunit + 1) % divisor
              repunit_index += 1
       return repunit_index


def     SCREAMING_SNAKE_CASE			(      lowerCAmelCase = 1_000_000					):
       _UpperCamelCase              =						limit - 1
       if divisor % 2 == 0:
              divisor += 1
       while least_divisible_repunit(lowerCAmelCase					) <= limit:
              divisor += 2
       return divisor


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













from __future__ import annotations

import math


def     SCREAMING_SNAKE_CASE			(      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


lowercase    : Tuple    	=  [num for num in range(3, 10_0001, 2) if not is_prime(num)]


def     SCREAMING_SNAKE_CASE			(      lowerCAmelCase					):
       if not isinstance(lowerCAmelCase    ,       lowerCAmelCase					):
              raise ValueError('''n must be an integer'''					)
       if n <= 0:
              raise ValueError('''n must be >= 0'''					)

       _UpperCamelCase              =						[]
       for num in range(len(lowerCAmelCase					)					):
              _UpperCamelCase              =						0
              while 2 * i * i <= odd_composites[num]:
                     _UpperCamelCase              =						odd_composites[num] - 2 * i * i
                     if is_prime(lowerCAmelCase					):
                            break
                     i += 1
              else:
                     list_nums.append(odd_composites[num]					)
                     if len(lowerCAmelCase					) == n:
                            return list_nums

       return []


def     SCREAMING_SNAKE_CASE			(      ):
       return compute_nums(1					)[0]


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






