"""simple docstring"""


import os

# Precomputes a list of the 100 first triangular numbers
UpperCamelCase						:				Dict             =      [int(0.5 * n * (n + 1)) for n in range(1, 101)]







def  __snake_case       (   )      ->		Optional[int]:







		"""simple docstring"""





		A					       = os.path.dirname(os.path.realpath(UpperCamelCase__	)	)
		A					       = os.path.join(UpperCamelCase__ ,			'words.txt'	)

		A					       = ''
		with open(UpperCamelCase__	) as f:
				A					       = f.readline()

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


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









"""simple docstring"""


from __future__ import annotations







def  __snake_case       (   UpperCamelCase__	)      ->		int:







		"""simple docstring"""





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


if __name__ == "__main__":
	import doctest

	doctest.testmod()





