from __future__ import annotations





def       __lowerCamelCase			(				UpperCamelCase__   ):







							'''simple docstring'''






							snake_case_           =					[True] * limit
							snake_case_           =					False
							snake_case_           =					False
							snake_case_           =					True

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

							snake_case_           =					[2]

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

							return primes





def       __lowerCamelCase			(				UpperCamelCase__ = 1000000   ):







							'''simple docstring'''






							snake_case_           =					prime_sieve(snake_case_   )
							snake_case_           =					0
							snake_case_           =					0

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

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

							return largest


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







def       __lowerCamelCase			(				UpperCamelCase__ = 50000000   ):







							'''simple docstring'''






							snake_case_           =					set()
							snake_case_           =					int((limit - 24) ** (1 / 2)   )

							snake_case_           =					set(range(3     ,							prime_square_limit + 1     ,							2   )   )
							primes.add(2   )
							for p in range(3     ,							prime_square_limit + 1     ,							2   ):
														if p not in primes:
																					continue
														primes.difference_update(set(range(p * p     ,							prime_square_limit + 1     ,							UpperCamelCase__   )   )   )

							for primea in primes:
														snake_case_           =					primea * primea
														for primea in primes:
																					snake_case_           =					primea * primea * primea
																					if square + cube >= limit - 16:
																												break
																					for primea in primes:
																												snake_case_           =					primea * primea * primea * primea
																												snake_case_           =					square + cube + tetr
																												if total >= limit:
																																			break
																												ret.add(UpperCamelCase__   )

							return len(UpperCamelCase__   )


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




