






'''simple docstring'''
from __future__ import annotations

import math




def 		__SCREAMING_SNAKE_CASE					(  _UpperCamelCase							):


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


UpperCamelCase__ =			[num for num in range(3, 100001, 2) if not is_prime(num)]




def 		__SCREAMING_SNAKE_CASE					(  _UpperCamelCase							):


   """simple docstring"""




   if not isinstance(_UpperCamelCase						,		_UpperCamelCase							):
      raise ValueError("n must be an integer"							)
   if n <= 0:
      raise ValueError("n must be >= 0"							)

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

   return []




def 		__SCREAMING_SNAKE_CASE					(  ):


   """simple docstring"""




   return compute_nums(1							)[0]


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












'''simple docstring'''
def 		__SCREAMING_SNAKE_CASE					(  _UpperCamelCase							):


   """simple docstring"""




   if number < 0:
      raise ValueError("number must not be negative"							)
   return number & (number - 1) == 0


if __name__ == "__main__":
 import doctest

 doctest.testmod()




