"""simple docstring"""





import os

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





def        a_  (   ):





       '''simple docstring'''

       lowercase__    :	str     					=			os.path.dirname(os.path.realpath(__lowercase  )  )
       lowercase__    :	Tuple     					=			os.path.join(__lowercase     ,				'words.txt'  )

       lowercase__    :	str     					=			''
       with open(__lowercase  ) as f:
              lowercase__    :	Optional[Any]     					=			f.readline()

       lowercase__    :	Tuple     					=			[word.strip('"'  ) for word in words.strip('\r\n'  ).split(','  )]
       lowercase__    :	Optional[Any]     					=			[
           word
           for word in [sum(ord(__lowercase  ) - 64 for x in word  ) for word in words]
           if word in TRIANGULAR_NUMBERS
       ]
       return len(__lowercase  )


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





import math





def        a_  (   _lowerCAmelCase						:				int = 100  ):





       '''simple docstring'''

       lowercase__    :	Union[str, Any]     					=			sum(i * i for i in range(1     ,				n + 1  )  )
       lowercase__    :	str     					=			int(math.pow(sum(range(1     ,				n + 1  )  )     ,				2  )  )
       return square_of_sum - sum_of_squares


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

