






'''simple docstring'''





from typing import Any






def 				lowerCamelCase__				(_UpperCAmelCase):

			if not input_list:
						return []
			SCREAMING_SNAKE_CASE						= [input_list.count(snake_case__) for value in input_list]
			SCREAMING_SNAKE_CASE						= max(snake_case__)  # Gets the maximum count in the input list.
			# Gets values of modes
			return sorted({input_list[i] for i, value in enumerate(snake_case__) if value == y})


if __name__ == "__main__":
				import doctest

				doctest.testmod()












import os

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






def 				lowerCamelCase__				():
			SCREAMING_SNAKE_CASE						= os.path.dirname(os.path.realpath(_UpperCAmelCase))
			SCREAMING_SNAKE_CASE						= os.path.join(_UpperCAmelCase							,       'words.txt')

			SCREAMING_SNAKE_CASE						= ''
			with open(_UpperCAmelCase) 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(_UpperCAmelCase) - 64 for x in word) for word in words]
			    if word in TRIANGULAR_NUMBERS
			]
			return len(_UpperCAmelCase)


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




