
"""simple docstring"""


from __future__ import annotations







class 					lowerCAmelCase_					:



						'''simple docstring'''


						def __init__(			self  :   Optional[int]	,A_  :   str	,A_  :   str   )  -> int:
							A ,   A     = text, pattern
							A ,   A     = len(A_   ), len(A_   )


						def     _SCREAMING_SNAKE_CASE   (			self  :   str	,A_  :   str   )  -> int:

							for i in range(self.patLen - 1	,-1	,-1   ):
								if char == self.pattern[i]:
									return i
							return -1


						def     _SCREAMING_SNAKE_CASE   (			self  :   Optional[int]	,A_  :   int   )  -> int:

							for i in range(self.patLen - 1	,-1	,-1   ):
								if self.pattern[i] != self.text[current_pos + i]:
									return current_pos + i
							return -1




						def     _SCREAMING_SNAKE_CASE   (			self  :   Tuple   )  -> list[int]:
							# searches pattern in text and returns index positions
							A     = []
							for i in range(self.textLen - self.patLen + 1   ):
								A     = self.mismatch_in_text(A_   )
								if mismatch_index == -1:
									positions.append(A_   )
								else:
									A     = self.match_in_pattern(self.text[mismatch_index]   )
									A     = (
									    mismatch_index - match_index
									)  # shifting index lgtm [py/multiple-definition]
							return positions

_lowercase				 =					'''ABAABA'''
_lowercase				 =					'''AB'''
_lowercase				 =					BoyerMooreSearch(text, pattern)
_lowercase				 =					bms.bad_character_heuristic()

if len(positions) == 0:
		print('''No match found''')
else:
		print('''Pattern found in following positions: ''')
		print(positions)

"""simple docstring"""


import os

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






def    _snake_case					(		):
	A     = os.path.dirname(os.path.realpath(snake_case__  )  )
	A     = os.path.join(snake_case__						,   'words.txt'  )

	A     = ''
	with open(snake_case__  ) as f:
		A     = f.readline()

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


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