import os

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






def 							__UpperCAmelCase     (							)->							Dict:



			"""simple docstring"""







			lowercase       		=		os.path.dirname(os.path.realpath(lowercase__							)							)
			lowercase       		=		os.path.join(lowercase__,		'''words.txt'''							)

			lowercase       		=		''''''
			with open(lowercase__							) as f:
						lowercase       		=		f.readline()

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








'''simple docstring'''

def 					__UpperCamelCase				(						lowercase__    :	List[str],       lowercase__    :	Tuple			):






     '''simple docstring'''





     __lowercase      		=[0 for i in range(r + 1			)]
     # nc0 = 1
     __lowercase      		=1
     for i in range(1,       n + 1			):
          # to compute current row from previous row.
          __lowercase      		=min(lowercase__,       lowercase__			)
          while j > 0:
               c[j] += c[j - 1]
               j -= 1
     return c[r]







print(binomial_coefficient(n=10, r=5))


