

class _UpperCamelCase							:
			'''simple docstring'''







			def __init__(			self							: Union[str, Any]      ,      a							: Any	)							->       Union[str, Any]:

				"""simple docstring"""

				SCREAMING_SNAKE_CASE   :      Any				     =       arr.split(","	)






			def 							__UpperCamelCase (			self							: Union[str, Any]	)							->       Tuple:

				"""simple docstring"""

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


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



from __future__ import annotations

def  lowerCamelCase__ (					_a							,			_a):
	if b == 0:
		return (1, 0)
	((SCREAMING_SNAKE_CASE)     ,(SCREAMING_SNAKE_CASE))   :      Tuple				     =       extended_euclid(_a							,			a % b)
	SCREAMING_SNAKE_CASE   :      Dict				     =       a // b
	return (y, x - k * y)

def  lowerCamelCase__ (					_a							,			_a							,			_a							,			_a):
	((SCREAMING_SNAKE_CASE)     ,(SCREAMING_SNAKE_CASE))   :      str				     =       extended_euclid(_a							,			_a)
	SCREAMING_SNAKE_CASE   :      str				     =       na * na
	SCREAMING_SNAKE_CASE   :      int				     =       ra * x * na + ra * y * na
	return (n % m + m) % m

def  lowerCamelCase__ (					_a							,			_a):
	((SCREAMING_SNAKE_CASE)     ,(SCREAMING_SNAKE_CASE))   :      List[str]				     =       extended_euclid(_a							,			_a)
	if b < 0:
		SCREAMING_SNAKE_CASE   :      int				     =       (b % n + n) % n
	return b

def  lowerCamelCase__ (					_a							,			_a							,			_a							,			_a):
	SCREAMING_SNAKE_CASE     ,SCREAMING_SNAKE_CASE   :      Dict				     =       invert_modulo(_a							,			_a), invert_modulo(_a							,			_a)
	SCREAMING_SNAKE_CASE   :      Optional[int]				     =       na * na
	SCREAMING_SNAKE_CASE   :      Optional[Any]				     =       ra * x * na + ra * y * na
	return (n % m + m) % m


if __name__ == "__main__":
			from doctest import testmod

			testmod(name='chinese_remainder_theorem', verbose=True)
			testmod(name='chinese_remainder_theorem2', verbose=True)
			testmod(name='invert_modulo', verbose=True)
			testmod(name='extended_euclid', verbose=True)