"""simple docstring"""
from collections.abc import Sequence







def 						__a   (	_SCREAMING_SNAKE_CASE = None   )	->int:
  if nums is None or not nums:
    raise ValueError('Input sequence should not be empty'   )

  a__:     List[Any]										=	nums[0]
  for i in range(1		,     len(_SCREAMING_SNAKE_CASE   )   ):
    a__:     Optional[int]										=	nums[i]
    a__:     Dict										=	max(_SCREAMING_SNAKE_CASE		,     ans + num		,     _SCREAMING_SNAKE_CASE   )

  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 math







def 						__a   (	_SCREAMING_SNAKE_CASE   )	->bool:

  if 1 < number < 4:
    # 2 and 3 are primes
    return True
  elif number < 2 or number % 2 == 0 or number % 3 == 0:
    # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
    return False

  # All primes number are in format of 6k +/- 1
  for i in range(5		,     int(math.sqrt(_SCREAMING_SNAKE_CASE   ) + 1   )		,     6   ):
    if number % i == 0 or number % (i + 2) == 0:
      return False
  return True







def 						__a   (	_SCREAMING_SNAKE_CASE = 0.1   )	->int:
  a__:     str										=	3
  a__:     Optional[Any]										=	3

  while primes / (2 * j - 1) >= ratio:
    for i in range(j * j + j + 1		,     (j + 2) * (j + 2)		,     j + 1   ):
      primes += is_prime(_SCREAMING_SNAKE_CASE   )
    j += 2
  return j


if __name__ == "__main__":
 import doctest

 doctest.testmod()


