

import os

# Precomputes a list of the 100 first triangular numbers
lowercase_             =     [int(0.5 * n * (n + 1)) for n in range(1, 1_0_1)]
def   a   (    )					->   int:





      """simple docstring"""



      _lowercase			 =os.path.dirname(os.path.realpath(A__  )  )
      _lowercase			 =os.path.join(A__   ,     'words.txt'  )

      _lowercase			 =''
      with open(A__  ) as f:
            _lowercase			 =f.readline()

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


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





def   a   (    A__			:     str   ,     A__			:     int  )					->   list[str]:





      """simple docstring"""



      return [sentence[i : i + ngram_size] for i in range(len(A__  ) - ngram_size + 1  )]


if __name__ == "__main__":
  from doctest import testmod

  testmod()


