

"""simple docstring"""





import os

# Precomputes a list of the 100 first triangular numbers
__UpperCamelCase  :      Optional[Any]							      =		[int(0.5 * n * (n + 1)) for n in range(1, 1_0_1)]

def   __SCREAMING_SNAKE_CASE  (      ):
	lowerCAmelCase__	:						str  				=	os.path.dirname(os.path.realpath(A_ ) )
	lowerCAmelCase__	:						Any  				=	os.path.join(A_						,     '''words.txt''' )

	lowerCAmelCase__	:						Optional[int]  				=	''''''
	with open(A_ ) as f:
		lowerCAmelCase__	:						Optional[Any]  				=	f.readline()

	lowerCAmelCase__	:						Optional[Any]  				=	[word.strip('''"''' ) for word in words.strip('''\r\n''' ).split(''',''' )]
	lowerCAmelCase__	:						Dict  				=	[
	    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"""





def   __SCREAMING_SNAKE_CASE  (      A_						,     A_ ):
	return numa ^ numa < 0


if __name__ == "__main__":
							import doctest

							doctest.testmod()




