from __future__ import annotations



def 	__SCREAMING_SNAKE_CASE  (					__UpperCamelCase    :       str	)							->					int:







  """simple docstring"""





  if not nums:
    return 0
  SCREAMING_SNAKE_CASE__										=      nums[0]
  SCREAMING_SNAKE_CASE__										=      0
  for num in nums[1:]:
    SCREAMING_SNAKE_CASE__										=      (
        max_excluding + num,
        max(lowerCAmelCase_ ,     lowerCAmelCase_	),
    )
  return max(lowerCAmelCase_ ,     lowerCAmelCase_	)


if __name__ == "__main__":
   import doctest

   doctest.testmod()





'''simple docstring'''

def      __lowerCamelCase     (      )			->      Tuple:
		for n in range(1						,			1000000  ):
				yield n * (n + 1) // 2



def      __lowerCamelCase     (      lowerCAmelCase_  )			->      List[Any]:
		_a     :      Any        =							1
		_a     :      Tuple        =							2
		while i * i <= n:
				_a     :      Tuple        =							0
				while n % i == 0:
						n //= i
						multiplicity += 1
				divisors_count *= multiplicity + 1
				i += 1
		if n > 1:
				divisors_count *= 2
		return divisors_count



def      __lowerCamelCase     (      )			->      str:
		return next(i for i in triangle_number_generator() if count_divisors(lowerCAmelCase_  ) > 500  )


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




