



"""simple docstring"""


import itertools
from pathlib import Path

def 					_lowerCAmelCase (  lowercase_		):
						UpperCAmelCase			 =					[tuple(lowercase_		) for login in logins]

						UpperCAmelCase			 =					{char for login in split_logins for char in login}

						for permutation in itertools.permutations(lowercase_		):
												UpperCAmelCase			 =					True
												for login in logins:
																		if not (
																		    permutation.index(login[0]		)
																		    < permutation.index(login[1]		)
																		    < permutation.index(login[2]		)
																		):
																								UpperCAmelCase			 =					False
																								break

												if satisfied:
																		return int(''.join(lowercase_		)		)

						raise Exception('Unable to find the secret passcode'		)

def 					_lowerCAmelCase (  lowercase_ = "keylog.txt"		):
						UpperCAmelCase			 =					Path(lowercase_		).parent.joinpath(lowercase_		).read_text().splitlines()

						return find_secret_passcode(lowercase_		)


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())




