'''simple docstring'''

from ..utils import DummyObject, requires_backends





class 							lowercase						(						metaclass=__lowerCamelCase ):
   lowerCamelCase_    					=['onnx']


   def __init__(   self				:	Any   ,		*__lowerCAmelCase				:	List[Any]   ,		**__lowerCAmelCase				:	str)      ->					Tuple:
         requires_backends(self   ,		["onnx"])


   @classmethod
   def __UpperCAmelCase       (   cls				:	Tuple   ,		*__lowerCAmelCase				:	str   ,		**__lowerCAmelCase				:	Dict)      ->					Optional[Any]:
         requires_backends(cls   ,		["onnx"])


   @classmethod
   def __UpperCAmelCase       (   cls				:	Union[str, Any]   ,		*__lowerCAmelCase				:	int   ,		**__lowerCAmelCase				:	Tuple)      ->					Optional[Any]:
         requires_backends(cls   ,		["onnx"])







'''simple docstring'''

from __future__ import annotations


def __a (	__lowerCamelCase			:						int				)	->							list[int]:
      '''simple docstring'''


      lowercase_     =      [True] * limit
      lowercase_     =      False
      lowercase_     =      False
      lowercase_     =      True

      for i in range(3 ,		int(limit**0.5 + 1				) ,		2				):
            lowercase_     =      i * 2
            while index < limit:
                  lowercase_     =      False
                  lowercase_     =      index + i

      lowercase_     =      [2]

      for i in range(3 ,		__lowerCamelCase ,		2				):
            if is_prime[i]:
                  primes.append(__lowerCamelCase				)

      return primes


def __a (	__lowerCamelCase			:						int = 1_000_000				)	->							int:
      '''simple docstring'''


      lowercase_     =      prime_sieve(__lowerCamelCase				)
      lowercase_     =      0
      lowercase_     =      0

      for i in range(len(__lowerCamelCase				)				):
            for j in range(i + length ,		len(__lowerCamelCase				)				):
                  lowercase_     =      sum(primes[i:j]				)
                  if sol >= ceiling:
                        break

                  if sol in primes:
                        lowercase_     =      j - i
                        lowercase_     =      sol

      return largest


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






