


from __future__ import annotations

from collections.abc import Generator



def 				UpperCamelCase_(      )    ->						Generator[int, None, None]:
    _lowercase       :							dict[int, int]      		=		{}
    _lowercase       :							Optional[int]      		=		2
    while True:
        _lowercase       :							List[Any]      		=		factor_map.pop(lowerCamelCase_							, lowerCamelCase_ )
        if factor:
            _lowercase       :							Optional[Any]      		=		factor + prime
            while x in factor_map:
                x += factor
            _lowercase       :							Optional[int]      		=		factor
        else:
            _lowercase       :							Union[str, Any]      		=		prime
            yield prime
        prime += 1



def 				UpperCamelCase_(      lowerCamelCase_ = 1e10 )    ->						int:
    _lowercase       :							Optional[int]      		=		sieve()

    _lowercase       :							int      		=		1
    while True:
        _lowercase       :							Any      		=		next(lowerCamelCase_ )
        if (2 * prime * n) > limit:
            return n
        # Ignore the next prime as the reminder will be 2.
        next(lowerCamelCase_ )
        n += 2


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









"""simple docstring"""




import os

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





def 						UpperCAmelCase__		(     ):






  """simple docstring"""





  A_  :       Union[str, Any]										=  os.path.dirname(os.path.realpath(_UpperCAmelCase					)					)
  A_  :       Tuple										=  os.path.join(_UpperCAmelCase ,					'words.txt'					)

  A_  :       List[Any]										=  ''
  with open(_UpperCAmelCase					) as f:
    A_  :       int										=  f.readline()

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