






from ..utils import DummyObject, requires_backends

class 		_snake_case  (  metaclass=A__					):
			_lowercase		:    List[str]			     =							['''torch''', '''torchsde''']






			def __init__(       self		,					*a		,					**a)      ->       Optional[int]:
						requires_backends(self		,					['torch', 'torchsde'])






			@classmethod
			def    SCREAMING_SNAKE_CASE__    (       cls		,					*a		,					**a)      ->       List[str]:
						requires_backends(cls		,					['torch', 'torchsde'])







			@classmethod
			def    SCREAMING_SNAKE_CASE__    (       cls		,					*a		,					**a)      ->       List[Any]:
						requires_backends(cls		,					['torch', 'torchsde'])












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




