from __future__ import annotations




def 							UpperCamelCase		(			__lowercase		:					Tuple      ):
		'''simple docstring'''




		A_						:							Dict      = [True] * limit
		A_						:							int      = False
		A_						:							List[Any]      = False
		A_						:							Optional[int]      = True

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

		A_						:							List[Any]      = [2]

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

		return primes




def 							UpperCamelCase		(			__lowercase		:					Union[str, Any] = 1_00_00_00      ):
		'''simple docstring'''




		A_						:							Optional[Any]      = prime_sieve(__lowercase      )
		A_						:							Union[str, Any]      = 0
		A_						:							int      = 0

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

						if sol in primes:
								A_						:							Optional[int]      = j - i
								A_						:							Dict      = sol

		return largest


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










def     lowercase	(    a = 50 ):



		'''simple docstring'''




		SCREAMING_SNAKE_CASE_				:int				     =						[1] * (length + 1)

		for row_length in range(3     , length + 1 ):
				for block_length in range(3     , row_length + 1 ):
						for block_start in range(row_length - block_length ):
								ways_number[row_length] += ways_number[
								    row_length - block_start - block_length - 1
								]

						ways_number[row_length] += 1

		return ways_number[length]


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






