




import os


def 		lowerCamelCase__       (						_A = "input.txt"				):







	'''simple docstring'''





	with open(os.path.join(os.path.dirname(_A				)	,      _A				)				) as input_file:
		snake_case_						       =	[
		    [int(_A				) for element in line.split(","				)]
		    for line in input_file.readlines()
		]

	snake_case_						       =	len(_A				)
	snake_case_						       =	len(matrix[0]				)

	snake_case_						       =	[[-1 for _ in range(_A				)] for _ in range(_A				)]
	for i in range(_A				):
		snake_case_						       =	matrix[i][0]

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

		for i in range(1	,      _A				):
			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() = }''')






import numpy as np


def 		lowerCamelCase__       (						_A				):







	'''simple docstring'''





	return (2 / (1 + np.exp(-2 * vector				))) - 1


if __name__ == "__main__":
		import doctest

		doctest.testmod()
