"""simple docstring"""







from math import factorial


def      __lowerCAmelCase(		__UpperCAmelCase = 20			):






	"""simple docstring"""





	_lowercase :    List[str]							=							2 * n  # middle entry of odd rows starting at row 3 is the solution for n = 1,
	# 2, 3,...
	_lowercase :    Tuple							=							n // 2

	return int(factorial(__UpperCAmelCase			) / (factorial(__UpperCAmelCase			) * factorial(n - k			))			)


if __name__ == "__main__":
						import sys

						if len(sys.argv) == 1:
												print(solution(20))
						else:
												try:
																		SCREAMING_SNAKE_CASE									=						int(sys.argv[1])
																		print(solution(n))
												except ValueError:
																		print('Invalid entry - please enter a number.')




"""simple docstring"""







from __future__ import annotations


def      __lowerCAmelCase(		__UpperCAmelCase			):






	"""simple docstring"""





	_lowercase :    Any							=							[True] * limit
	_lowercase :    Union[str, Any]							=							False
	_lowercase :    Any							=							False
	_lowercase :    List[Any]							=							True

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

	_lowercase :    Optional[Any]							=							[2]

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

	return primes


def      __lowerCAmelCase(		__UpperCAmelCase = 1_000_000			):






	"""simple docstring"""





	_lowercase :    Optional[Any]							=							prime_sieve(__UpperCAmelCase			)
	_lowercase :    int							=							0
	_lowercase :    List[Any]							=							0

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

			if sol in primes:
				_lowercase :    Optional[int]							=							j - i
				_lowercase :    Tuple							=							sol

	return largest


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



