



'''simple docstring'''


from collections.abc import Sequence






def  UpperCAmelCase_       (		lowercase__ = None       ):


     '''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(lowercase__       )       ):
          a_       		=nums[i]
          a_       		=max(lowercase__       ,	ans + num       ,	lowercase__       )

     return ans


if __name__ == "__main__":
  import doctest

  doctest.testmod()

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







'''simple docstring'''


import os
from math import logaa






def  UpperCAmelCase_       (		lowercase__ = "base_exp.txt"       ):


     '''simple docstring'''







     a_       		=0
     a_       		=0
     for i, line in enumerate(open(os.path.join(os.path.dirname(lowercase__       )       ,	lowercase__       )       )       ):
          a_		,						a_       		=list(map(lowercase__       ,	line.split(","       )       )       )
          if x * logaa(lowercase__       ) > largest:
               a_       		=x * logaa(lowercase__       )
               a_       		=i + 1
     return result


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


