




'''simple docstring'''



def 			SCREAMING_SNAKE_CASE_			(							__A    :			Tuple	,					__A    :			Any = " "  )			->			Union[str, Any]:
   _SCREAMING_SNAKE_CASE	=				[]

   _SCREAMING_SNAKE_CASE	=				0
   for index, char in enumerate(__A  ):
      if char == separator:
         split_words.append(string[last_index:index]  )
         _SCREAMING_SNAKE_CASE	=				index + 1
      elif index + 1 == len(__A  ):
         split_words.append(string[last_index : index + 1]  )
   return split_words


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

      testmod()







'''simple docstring'''



from collections.abc import Sequence
def 			SCREAMING_SNAKE_CASE_			(							__A    :			Sequence[int] | None = None  )			->			int:
   if nums is None or not nums:
      raise ValueError("Input sequence should not be empty"  )

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

   return ans


if __name__ == "__main__":
 import doctest

 doctest.testmod()

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

