




'''simple docstring'''



import os

# Precomputes a list of the 100 first triangular numbers
lowerCamelCase_			=						[int(0.5 * n * (n + 1)) for n in range(1, 1_01)]
def 			SCREAMING_SNAKE_CASE_			(							)			->			str:
   _SCREAMING_SNAKE_CASE	=				os.path.dirname(os.path.realpath(__A  )  )
   _SCREAMING_SNAKE_CASE	=				os.path.join(__A	,					"words.txt"  )

   _SCREAMING_SNAKE_CASE	=				""
   with open(__A  ) as f:
      _SCREAMING_SNAKE_CASE	=				f.readline()

   _SCREAMING_SNAKE_CASE	=				[word.strip("\""  ) for word in words.strip("\r\n"  ).split(","  )]
   _SCREAMING_SNAKE_CASE	=				[
       word
       for word in [sum(ord(__A  ) - 64 for x in word  ) for word in words]
       if word in TRIANGULAR_NUMBERS
   ]
   return len(__A  )


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







'''simple docstring'''



from collections.abc import Sequence
def 			SCREAMING_SNAKE_CASE_			(							__A    :			Sequence[int] | None = None  )			->			int:
   if nums is None or not nums:
      raise ValueError("Input sequence should not be empty"  )

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

   return ans


if __name__ == "__main__":
 import doctest

 doctest.testmod()

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

