
import os

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

def 				SCREAMING_SNAKE_CASE     (      ) ->       Optional[Any]:

				"""simple docstring"""







				A__  :	Dict         =							os.path.dirname(os.path.realpath(_lowercase       )       )
				A__  :	Optional[Any]         =							os.path.join(_lowercase							,						'''words.txt'''       )

				A__  :	List[Any]         =							''
				with open(_lowercase       ) as f:
								A__  :	str         =							f.readline()

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


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

from numpy import exp, pi, sqrt

def 				SCREAMING_SNAKE_CASE     (      __UpperCamelCase :						Dict							,						__UpperCamelCase :						float = 0.0							,						__UpperCamelCase :						float = 1.0       ) ->       int:

				"""simple docstring"""







				return 1 / sqrt(2 * pi * sigma**2       ) * exp(-((x - mu) ** 2) / (2 * sigma**2)       )


if __name__ == "__main__":
					import doctest

					doctest.testmod()