
import os

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



def 		lowercase_    (     )							->							Tuple:
    """simple docstring"""

    snake_case				  =      os.path.dirname(os.path.realpath(A__	)	)
    snake_case				  =      os.path.join(A__				,	"words.txt"	)

    snake_case				  =      ""
    with open(A__	) as f:
        snake_case				  =      f.readline()

    snake_case				  =      [word.strip("\""	) for word in words.strip("\r\n"	).split(","	)]
    snake_case				  =      [
        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 		lowercase_    (     A__				,	A__	)							->							List[Any]:
    """simple docstring"""

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





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

