






'''simple docstring'''





def 				lowerCamelCase__				(_UpperCAmelCase):
			if not isinstance(lowerCamelCase_							,       lowerCamelCase_):
						SCREAMING_SNAKE_CASE						= F'''Input value of [number={number}] must be an integer'''
						raise TypeError(lowerCamelCase_)
			if number < 0:
						return False
			SCREAMING_SNAKE_CASE						= number * number
			while number > 0:
						if number % 10 != number_square % 10:
									return False
						number //= 10
						number_square //= 10
			return True


if __name__ == "__main__":
				import doctest

				doctest.testmod()












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




