

def 							A			(  _UpperCAmelCase       :     list							,     _UpperCAmelCase       :     int = 0					)       ->				list:







			'''simple docstring'''
			_UpperCAmelCase	 =     length or len(_UpperCAmelCase					)
			_UpperCAmelCase	 =     False
			for i in range(length - 1					):
						if list_data[i] > list_data[i + 1]:
									_UpperCAmelCase ,  _UpperCAmelCase	 =     list_data[i + 1], list_data[i]
									_UpperCAmelCase	 =     True

			return list_data if not swapped else bubble_sort(_UpperCAmelCase							,     length - 1					)


if __name__ == "__main__":
							import doctest

							doctest.testmod()





import os

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





def 							A			(  )       ->				List[str]:







			'''simple docstring'''
			_UpperCAmelCase	 =     os.path.dirname(os.path.realpath(_UpperCAmelCase					)					)
			_UpperCAmelCase	 =     os.path.join(_UpperCAmelCase							,     'words.txt'					)

			_UpperCAmelCase	 =     ''
			with open(_UpperCAmelCase					) as f:
						_UpperCAmelCase	 =     f.readline()

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