





"""simple docstring"""


import os

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

def      UpperCamelCase							():
						UpperCamelCase				:		List[Any]				   =			os.path.dirname(os.path.realpath(SCREAMING_SNAKE_CASE     )     )
						UpperCamelCase				:		str				   =			os.path.join(SCREAMING_SNAKE_CASE							,     """words.txt"""     )

						UpperCamelCase				:		Optional[Any]				   =			""""""
						with open(SCREAMING_SNAKE_CASE     ) as f:
												UpperCamelCase				:		Dict				   =			f.readline()

						UpperCamelCase				:		int				   =			[word.strip("""\""""     ) for word in words.strip("""\r\n"""     ).split(""","""     )]
						UpperCamelCase				:		Union[str, Any]				   =			[
						    word
						    for word in [sum(ord(SCREAMING_SNAKE_CASE     ) - 64 for x in word     ) for word in words]
						    if word in TRIANGULAR_NUMBERS
						]
						return len(SCREAMING_SNAKE_CASE     )


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







'''simple docstring'''
from __future__ import annotations

def 					lowerCamelCase_ ( __UpperCamelCase					:       dict							,    __UpperCamelCase					:       str		)					->	set[str]:







     """simple docstring"""
     _A		,				_A				=							set(__UpperCamelCase		), [start]

     while stack:
          _A				=							stack.pop()
          explored.add(__UpperCamelCase		)
          # Differences from BFS:
          # 1) pop last element instead of first one
          # 2) add adjacent elements to stack without exploring them
          for adj in reversed(graph[v]		):
               if adj not in explored:
                    stack.append(__UpperCamelCase		)
     return explored


lowerCAmelCase						=					{
    """A""": ["""B""", """C""", """D"""],
    """B""": ["""A""", """D""", """E"""],
    """C""": ["""A""", """F"""],
    """D""": ["""B""", """D"""],
    """E""": ["""B""", """F"""],
    """F""": ["""C""", """E""", """G"""],
    """G""": ["""F"""],
}

if __name__ == "__main__":
    import doctest

    doctest.testmod()
    print(depth_first_search(G, """A"""))





