






'''simple docstring'''







import os

# Precomputes a list of the 100 first triangular numbers
UpperCamelCase    :      str  			=		[int(0.5 * n * (n + 1)) for n in range(1, 1_01)]
def 						A__			(				):
						lowerCamelCase__         =  os.path.dirname(os.path.realpath(__lowerCAmelCase						)						)
						lowerCamelCase__         =  os.path.join(__lowerCAmelCase   ,    """words.txt"""						)

						lowerCamelCase__         =  """"""
						with open(__lowerCAmelCase						) as f:
												lowerCamelCase__         =  f.readline()

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


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









'''simple docstring'''







def 						A__			(				):
						return [
						    a * b * (1000 - a - b)
						    for a in range(1   ,    999						)
						    for b in range(__lowerCAmelCase   ,    999						)
						    if (a * a + b * b == (1000 - a - b) ** 2)
						][0]


if __name__ == "__main__":
							print(F'{solution() = }')

