
lowercase__	:List[str]										=					{
    0: "0",
    1: "1",
    2: "2",
    3: "3",
    4: "4",
    5: "5",
    6: "6",
    7: "7",
    8: "8",
    9: "9",
    10: "a",
    11: "b",
    12: "c",
    13: "d",
    14: "e",
    15: "f",
}



def  UpperCamelCase					(							lowerCAmelCase__	):
					'''simple docstring'''
					assert type(lowerCAmelCase__	) in (int, float) and decimal == int(lowerCAmelCase__	)
					lowercase					=		int(lowerCAmelCase__	)
					lowercase					=		''''''
					lowercase					=		False
					if decimal < 0:
										lowercase					=		True
										decimal *= -1
					while decimal > 0:
										lowercase			,		lowercase					=		divmod(lowerCAmelCase__				,    16	)
										lowercase					=		values[remainder] + hexadecimal
					lowercase					=		'''0x''' + hexadecimal
					if negative:
										lowercase					=		'''-''' + hexadecimal
					return hexadecimal


if __name__ == "__main__":
							import doctest

							doctest.testmod()






import os



def  UpperCamelCase					(							lowerCAmelCase__ = "input.txt"	):
					'''simple docstring'''

					with open(os.path.join(os.path.dirname(lowerCAmelCase__	)				,    lowerCAmelCase__	)	) as input_file:
										lowercase					=		[
										    [int(lowerCAmelCase__	) for element in line.split(''','''	)]
										    for line in input_file.readlines()
										]

					lowercase					=		len(lowerCAmelCase__	)
					lowercase					=		len(matrix[0]	)

					lowercase					=		[[-1 for _ in range(lowerCAmelCase__	)] for _ in range(lowerCAmelCase__	)]
					for i in range(lowerCAmelCase__	):
										lowercase					=		matrix[i][0]

					for j in range(1				,    lowerCAmelCase__	):
										for i in range(lowerCAmelCase__	):
															lowercase					=		minimal_path_sums[i][j - 1] + matrix[i][j]

										for i in range(1				,    lowerCAmelCase__	):
															lowercase					=		min(
															    minimal_path_sums[i][j]				,    minimal_path_sums[i - 1][j] + matrix[i][j]	)

										for i in range(rows - 2				,    -1				,    -1	):
															lowercase					=		min(
															    minimal_path_sums[i][j]				,    minimal_path_sums[i + 1][j] + matrix[i][j]	)

					return min(minimal_path_sums_row[-1] for minimal_path_sums_row in minimal_path_sums	)


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




