




'''simple docstring'''





from itertools import combinations_with_replacement





def UpperCAmelCase    (       UpperCAmelCase_ = 100						):
    _a				:							List[str]							       =      [*list(range(1   ,	21						)						), 25]
    _a				:							Tuple							       =      [2 * x for x in range(1   ,	21						)] + [50]
    _a				:							List[str]							       =      [3 * x for x in range(1   ,	21						)]
    _a				:							Union[str, Any]							       =      singles + doubles + triples + [0]

    _a				:							Optional[Any]							       =      0
    _a				:							Tuple							       =      42
    _a				:							Union[str, Any]							       =      42
    _a				:							Tuple							       =      42
    _a				:							Union[str, Any]							       =      42

    for double in doubles:
        for throwa, throwa in combinations_with_replacement(a__   ,	2						):
            _a				:							Tuple							       =      double + throwa + throwa
            if checkout_total < limit:
                num_checkouts += 1

    return num_checkouts


if __name__ == "__main__":
  print(F"""{solution() = }""")








'''simple docstring'''
import os
def 							snake_case_    (  ):



    """simple docstring"""




    __lowercase     							=		os.path.dirname(os.path.realpath(a__     )     )
    __lowercase     							=		os.path.join(a__       ,"""triangle.txt"""     )

    with open(a__     ) as f:
        __lowercase     							=		f.readlines()

    __lowercase     							=		[[int(a__     ) for y in x.rstrip("""\r\n"""     ).split(""" """     )] for x in triangle]

    for i in range(1       ,len(a__     )     ):
        for j in range(len(a[i]     )     ):
            __lowercase     							=		a[i - 1][j] if j != len(a[i - 1]     ) else 0
            __lowercase     							=		a[i - 1][j - 1] if j > 0 else 0
            a[i][j] += max(a__       ,a__     )
    return max(a[-1]     )


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




