

'''simple docstring'''





import math

UpperCamelCase_    						=       10
UpperCamelCase_    						=       7
UpperCamelCase_    						=       BALLS_PER_COLOUR * NUM_COLOURS






def 				_lowerCAmelCase			(   __magic_name__						:     int = 20						)				->  str:
						lowercase :							Any    		=math.comb(__magic_name__   , __magic_name__						)
						lowercase :							Any    		=math.comb(NUM_BALLS - BALLS_PER_COLOUR   , __magic_name__						)

						lowercase :							Optional[Any]    		=NUM_COLOURS * (1 - missing_colour / total)

						return f'''{result:.9f}'''


if __name__ == "__main__":
							print(solution(20))










from collections.abc import Sequence






def  lowerCamelCase_	(      lowerCAmelCase__	:	Sequence[int] | None = None				)       ->							int:

							'''simple docstring'''






							if nums is None or not nums:
														raise ValueError('Input sequence should not be empty'				)

							A      						=    nums[0]
							for i in range(1			,	len(lowerCAmelCase__				)				):
														A      						=    nums[i]
														A      						=    max(lowerCAmelCase__			,	ans + num			,	lowerCAmelCase__				)

							return ans


if __name__ == "__main__":
				import doctest

				doctest.testmod()

				# Try on a sample input from the user
				__snake_case     :str			       =int(input('Enter number of elements : ').strip())
				__snake_case     :Optional[int]			       =list(map(int, input('\nEnter the numbers : ').strip().split()))[:n]
				print(max_subsequence_sum(array))