
from __future__ import annotations

from collections.abc import MutableSequence





class     __UpperCamelCase :






     """simple docstring"""







     def __init__(				self							:							int     ,						_A							:							int     ,						_A							:							MutableSequence[float] ):







       """simple docstring"""




       if len(_A ) != degree + 1:
         raise ValueError(
             '''The number of coefficients should be equal to the degree + 1.''' )

       __SCREAMING_SNAKE_CASE      :	list[float]					=		list(_A )
       __SCREAMING_SNAKE_CASE      :	Any					=		degree



     def __add__(				self							:							Union[str, Any]     ,						_A							:							Polynomial ):







       """simple docstring"""




       if self.degree > polynomial_a.degree:
         __SCREAMING_SNAKE_CASE      :	Any					=		self.coefficients[:]
         for i in range(polynomial_a.degree + 1 ):
           coefficients[i] += polynomial_a.coefficients[i]
         return Polynomial(self.degree     ,						_A )
       else:
         __SCREAMING_SNAKE_CASE      :	List[str]					=		polynomial_a.coefficients[:]
         for i in range(self.degree + 1 ):
           coefficients[i] += self.coefficients[i]
         return Polynomial(polynomial_a.degree     ,						_A )



     def __sub__(				self							:							Any     ,						_A							:							Polynomial ):







       """simple docstring"""




       return self + polynomial_a * Polynomial(0     ,						[-1] )



     def __neg__(				self							:							int ):







       """simple docstring"""




       return Polynomial(self.degree     ,						[-c for c in self.coefficients] )



     def __mul__(				self							:							Tuple     ,						_A							:							Polynomial ):







       """simple docstring"""




       __SCREAMING_SNAKE_CASE      :	list[float]					=		[0] * (self.degree + polynomial_a.degree + 1)
       for i in range(self.degree + 1 ):
         for j in range(polynomial_a.degree + 1 ):
           coefficients[i + j] += (
               self.coefficients[i] * polynomial_a.coefficients[j]
           )

       return Polynomial(self.degree + polynomial_a.degree     ,						_A )



     def  UpperCAmelCase__							(				self							:							int     ,						_A							:							int | float ):







       """simple docstring"""




       __SCREAMING_SNAKE_CASE      :	int | float					=		0
       for i in range(self.degree + 1 ):
         result += self.coefficients[i] * (substitution**i)
       return result



     def __str__(				self							:							Tuple ):







       """simple docstring"""




       __SCREAMING_SNAKE_CASE      :	str					=		''''''
       for i in range(self.degree     ,						-1     ,						-1 ):
         if self.coefficients[i] == 0:
           continue
         elif self.coefficients[i] > 0:
           if polynomial:
             polynomial += " + "
         else:
           polynomial += " - "

         if i == 0:
           polynomial += str(abs(self.coefficients[i] ) )
         elif i == 1:
           polynomial += str(abs(self.coefficients[i] ) ) + "x"
         else:
           polynomial += str(abs(self.coefficients[i] ) ) + "x^" + str(_A )

       return polynomial



     def __repr__(				self							:							Any ):







       """simple docstring"""




       return self.__str__()



     def  UpperCAmelCase__							(				self							:							Optional[Any] ):







       """simple docstring"""




       __SCREAMING_SNAKE_CASE      :	list[float]					=		[0] * self.degree
       for i in range(self.degree ):
         __SCREAMING_SNAKE_CASE      :	Optional[int]					=		self.coefficients[i + 1] * (i + 1)
       return Polynomial(self.degree - 1     ,						_A )



     def  UpperCAmelCase__							(				self							:							Union[str, Any]     ,						_A							:							int | float = 0 ):







       """simple docstring"""




       __SCREAMING_SNAKE_CASE      :	list[float]					=		[0] * (self.degree + 2)
       __SCREAMING_SNAKE_CASE      :	List[Any]					=		constant
       for i in range(self.degree + 1 ):
         __SCREAMING_SNAKE_CASE      :	Dict					=		self.coefficients[i] / (i + 1)
       return Polynomial(self.degree + 1     ,						_A )



     def __eq__(				self							:							Tuple     ,						_A							:							object ):







       """simple docstring"""




       if not isinstance(_A     ,						_A ):
         return False

       if self.degree != polynomial_a.degree:
         return False

       for i in range(self.degree + 1 ):
         if self.coefficients[i] != polynomial_a.coefficients[i]:
           return False

       return True




     def __ne__(				self							:							Optional[Any]     ,						_A							:							object ):







       """simple docstring"""




       return not self.__eq__(_A )







"""simple docstring"""





from __future__ import annotations

import math
def 					__A  (_SCREAMING_SNAKE_CASE     )   ->bool:





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


__A											=						[num for num in range(3, 10_0001, 2) if not is_prime(num)]
def 					__A  (_SCREAMING_SNAKE_CASE     )   ->list[int]:





  """simple docstring"""


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

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

  return []
def 					__A  ()   ->int:





  """simple docstring"""


  return compute_nums(1     )[0]


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