





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""")

  __snake_case:						Optional[Any]   =						nums[0]
  for i in range(1					,					len(SCREAMING_SNAKE_CASE__)):
    __snake_case:						List[str]   =						nums[i]
    __snake_case:						Optional[Any]   =						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
      __UpperCAmelCase       :   List[str]				       =							int(input("Enter number of elements : ").strip())
      __UpperCAmelCase       :   Optional[int]				       =							list(map(int, input("\nEnter the numbers : ").strip().split()))[:n]
      print(max_subsequence_sum(array))













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__ = 1_0001)   ->    int:

  try:
    __snake_case:						List[str]   =						int(SCREAMING_SNAKE_CASE__)
  except (TypeError, ValueError):
    raise TypeError("""Parameter nth must be int or castable to int.""") from None
  if nth <= 0:
    raise ValueError("""Parameter nth must be greater than or equal to one.""")
  __snake_case:						list[int]   =						[]
  __snake_case:						List[str]   =						2
  while len(SCREAMING_SNAKE_CASE__) < nth:
    if is_prime(SCREAMING_SNAKE_CASE__):
      primes.append(SCREAMING_SNAKE_CASE__)
      num += 1
    else:
      num += 1
  return primes[len(SCREAMING_SNAKE_CASE__) - 1]


if __name__ == "__main__":
      print(f'{solution() = }')






