
"""simple docstring"""


from __future__ import annotations






def  lowercase						(	lowerCAmelCase__						):
			lowerCamelCase_					=  [True] * limit
			lowerCamelCase_					=  False
			lowerCamelCase_					=  False
			lowerCamelCase_					=  True

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

			lowerCamelCase_					=  [2]

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

			return primes






def  lowercase						(	lowerCAmelCase__ = 1_000_000						):
			lowerCamelCase_					=  prime_sieve(lowercase__						)
			lowerCamelCase_					=  0
			lowerCamelCase_					=  0

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

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

			return largest


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









"""simple docstring"""






import operator as op







def 	_snake_case     (							lowercase__						):
				_lowerCamelCase	:     Dict       =       []
				_lowerCamelCase	:     List[str]       =       lambda lowercase__				,       lowercase__						: int(x / y						)  # noqa: E731 integer division operation
				_lowerCamelCase	:     Optional[int]       =       {
				    '^': op.pow,
				    '*': op.mul,
				    '/': div,
				    '+': op.add,
				    '-': op.sub,
				}  # operators & their respective operation

				# print table header
				print('Symbol'.center(8						)				,       'Action'.center(12						)				,       'Stack'				,       sep=' | '						)
				print('-' * (30 + len(lowercase__						))						)

				for x in post_fix:
								if x.isdigit():  # if x in digit
												stack.append(lowercase__						)  # append x to stack
												# output in tabular format
												print(x.rjust(8						)				,       ('push(' + x + ')').ljust(12						)				,       ','.join(lowercase__						)				,       sep=' | '						)
								else:
												_lowerCamelCase	:     int       =       stack.pop()  # pop stack
												# output in tabular format
												print(''.rjust(8						)				,       ('pop(' + b + ')').ljust(12						)				,       ','.join(lowercase__						)				,       sep=' | '						)

												_lowerCamelCase	:     Tuple       =       stack.pop()  # pop stack
												# output in tabular format
												print(''.rjust(8						)				,       ('pop(' + a + ')').ljust(12						)				,       ','.join(lowercase__						)				,       sep=' | '						)

												stack.append(
												    str(opr[x](int(lowercase__						)				,       int(lowercase__						)						)						)						)  # evaluate the 2 values popped from stack & push result to stack
												# output in tabular format
												print(
												    x.rjust(8						)				,       ('push(' + a + x + b + ')').ljust(12						)				,       ','.join(lowercase__						)				,       sep=' | '				,       )

				return int(stack[0]						)


if __name__ == "__main__":
			lowercase__			=		input("""\n\nEnter a Postfix Equation (space separated) = """).split(""" """)
			print("""\n\tResult = """, solve(Postfix))