





'''simple docstring'''

from collections.abc import Sequence







def    a__							(							lowercase   :	Sequence[int] | None = None )						->						int:





     """simple docstring"""

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

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

     return ans


if __name__ == "__main__":
   import doctest

   doctest.testmod()

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








'''simple docstring'''
def A__       (	UpperCAmelCase_    ,    UpperCAmelCase_				):
						return base * power(UpperCAmelCase_    ,    (exponent - 1)				) if exponent else 1


if __name__ == "__main__":
					print('Raise base to the power of exponent using recursion...')
					snake_case_					:      int    			=    int(input('Enter the base: ').strip())
					snake_case_					:      Optional[int]    			=    int(input('Enter the exponent: ').strip())
					snake_case_					:      Optional[int]    			=    power(base, abs(exponent))
					if exponent < 0:  # power() does not properly deal w/ negative exponents
										snake_case_					:      List[Any]    			=    1 / result
					print(F"""{base} to the power of {exponent} is {result}""")


