




'''simple docstring'''


import os

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


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

		__a			=					''
		with open(a_			) as f:
				__a			=					f.readline()

		__a			=					[word.strip('"'			) for word in words.strip('\r\n'			).split(','			)]
		__a			=					[
		    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 ..utils import DummyObject, requires_backends





class    __lowercase						(  metaclass=__magic_name__ ):
   _a							=      ["""onnx"""]







   def __init__(	self      ,							*UpperCamelCase      ,							**UpperCamelCase      )				->    str:
     requires_backends(self      ,							['onnx']      )







   @classmethod
   def 		UpperCamelCase__			(	cls      ,							*UpperCamelCase      ,							**UpperCamelCase      )				->    Tuple:
     requires_backends(cls      ,							['onnx']      )







   @classmethod
   def 		UpperCamelCase__			(	cls      ,							*UpperCamelCase      ,							**UpperCamelCase      )				->    Tuple:
     requires_backends(cls      ,							['onnx']      )



