


from __future__ import annotations






def 						a__			(				A__				):
			SCREAMING_SNAKE_CASE_		:     Tuple					=					[True] * limit
			SCREAMING_SNAKE_CASE_		:     List[str]					=					False
			SCREAMING_SNAKE_CASE_		:     Optional[Any]					=					False
			SCREAMING_SNAKE_CASE_		:     str					=					True

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

			SCREAMING_SNAKE_CASE_		:     List[Any]					=					[2]

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

			return primes






def 						a__			(				A__ = 1_0_0_0_0_0_0				):
			SCREAMING_SNAKE_CASE_		:     List[str]					=					prime_sieve(A__				)
			SCREAMING_SNAKE_CASE_		:     List[str]					=					0
			SCREAMING_SNAKE_CASE_		:     Tuple					=					0

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

									if sol in primes:
												SCREAMING_SNAKE_CASE_		:     Tuple					=					j - i
												SCREAMING_SNAKE_CASE_		:     Tuple					=					sol

			return largest


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









from __future__ import annotations






def 						a__			(				A__,      A__ = None,      A__ = None				):
			if start is None:
						SCREAMING_SNAKE_CASE_		:     List[str]					=					0

			if end is None:
						SCREAMING_SNAKE_CASE_		:     Optional[Any]					=					len(A__				) - 1

			if start >= end:
						return

			SCREAMING_SNAKE_CASE_		:     Tuple					=					(start + end) // 2

			slowsort(A__,      A__,      A__				)
			slowsort(A__,      mid + 1,      A__				)

			if sequence[end] < sequence[mid]:
						SCREAMING_SNAKE_CASE_		,      SCREAMING_SNAKE_CASE_		:     Optional[Any]					=					sequence[mid], sequence[end]

			slowsort(A__,      A__,      end - 1				)


if __name__ == "__main__":
				from doctest import testmod

				testmod()





