






class 							SCREAMING_SNAKE_CASE__		:





					"""simple docstring"""






					def __init__(      self  :						int							,	__A  :						List[Any] ):
						# we need a list not a string, so do something to change the type
						snake_case__				:   Optional[Any]     =						arr.split("," )






					def  _lowercase  (      self  :						Tuple ):
						snake_case__				:   str     =						[int(self.array[0] )] * len(self.array )
						snake_case__				:   Union[str, Any]     =						[int(self.array[0] )] * len(self.array )
						for i in range(1							,	len(self.array ) ):
							snake_case__				:   Union[str, Any]     =						max(
							    int(self.array[i] ) + sum_value[i - 1]							,	int(self.array[i] ) )
							snake_case__				:   Dict     =						max(sum_value[i]							,	rear[i - 1] )
						return rear[len(self.array ) - 1]


if __name__ == "__main__":
	__lowerCamelCase      :    Any   		=   input("""please input some numbers:""")
	__lowerCamelCase      :    int   		=   SubArray(whole_array)
	__lowerCamelCase      :    int   		=   array.solve_sub_array()
	print(("""the results is:""", re))











from __future__ import annotations







def   SCREAMING_SNAKE_CASE       (				snake_case_      :							int     ):
	snake_case__				:   str     =						[True] * limit
	snake_case__				:   str     =						False
	snake_case__				:   str     =						False
	snake_case__				:   str     =						True

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

	snake_case__				:   Optional[Any]     =						[2]

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

	return primes







def   SCREAMING_SNAKE_CASE       (				snake_case_      :							int = 1000000     ):
	snake_case__				:   Optional[int]     =						prime_sieve(snake_case_     )
	snake_case__				:   List[Any]     =						0
	snake_case__				:   List[str]     =						0

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

			if sol in primes:
				snake_case__				:   Tuple     =						j - i
				snake_case__				:   str     =						sol

	return largest


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



