


'''simple docstring'''




from __future__ import annotations


def    UpperCAmelCase_  (       A      ):
   '''simple docstring'''





   _a					:  Optional[Any]						=  [True] * limit
   _a					:  Any						=  False
   _a					:  str						=  False
   _a					:  Optional[int]						=  True

   for i in range(3		,	int(limit**0.5 + 1      )		,	2      ):
      _a					:  Union[str, Any]						=  i * 2
      while index < limit:
         _a					:  Optional[Any]						=  False
         _a					:  Union[str, Any]						=  index + i

   _a					:  int						=  [2]

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

   return primes


def    UpperCAmelCase_  (       A = 1_0_0_0_0_0_0      ):
   '''simple docstring'''





   _a					:  str						=  prime_sieve(A__      )
   _a					:  str						=  0
   _a					:  List[str]						=  0

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

         if sol in primes:
            _a					:  List[str]						=  j - i
            _a					:  Optional[int]						=  sol

   return largest


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




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






def      UpperCamelCase_				(      A__						):
	a_      				=						[True] * limit
	a_      				=						False
	a_      				=						False
	a_      				=						True

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

	a_      				=						[2]

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

	return primes






def      UpperCamelCase_				(      A__ = 1_00_00_00						):
	a_      				=						prime_sieve(A__						)
	a_      				=						0
	a_      				=						0

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

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

	return largest


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