






from __future__ import annotations

import math






def     _snake_case    (__lowercase):

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


snake_case__      :	Optional[Any]       	=      [num for num in range(3, 1_0_0_0_0_1, 2) if not is_prime(num)]






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

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

   return []






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


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













def     _snake_case    (__lowercase = 1000):
   UpperCamelCase_		,      UpperCamelCase_									=     1, 1
   UpperCamelCase_									=     2
   while True:
      UpperCamelCase_									=     0
      UpperCamelCase_									=     fa + fa
      UpperCamelCase_		,      UpperCamelCase_									=     fa, f
      index += 1
      for _ in str(__lowercase):
         i += 1
      if i == n:
         break
   return index


if __name__ == "__main__":
 print(solution(int(str(input()).strip())))





