





'''simple docstring'''




a__					:			int          =     {
    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 						__lowerCamelCase			(	UpperCAmelCase_							)   ->str:
	assert type(UpperCAmelCase_							) in (int, float) and decimal == int(UpperCAmelCase_							)
	snake_case__	       =   int(UpperCAmelCase_							)
	snake_case__	       =   ''
	snake_case__	       =   False
	if decimal < 0:
		snake_case__	       =   True
		decimal *= -1
	while decimal > 0:
		snake_case__       ,  snake_case__	       =   divmod(UpperCAmelCase_					,				16							)
		snake_case__	       =   values[remainder] + hexadecimal
	snake_case__	       =   '0x' + hexadecimal
	if negative:
		snake_case__	       =   '-' + hexadecimal
	return hexadecimal


if __name__ == "__main__":
			import doctest

			doctest.testmod()










'''simple docstring'''




import os




def 						__lowerCamelCase			(	UpperCAmelCase_ = "input.txt"							)   ->int:

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

	snake_case__	       =   len(UpperCAmelCase_							)
	snake_case__	       =   len(matrix[0]							)

	snake_case__	       =   [[-1 for _ in range(UpperCAmelCase_							)] for _ in range(UpperCAmelCase_							)]
	for i in range(UpperCAmelCase_							):
		snake_case__	       =   matrix[i][0]

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

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

		for i in range(rows - 2					,				-1					,				-1							):
			snake_case__	       =   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() = }""")



