
"""simple docstring"""





from __future__ import annotations



def 						_lowerCAmelCase				(				UpperCamelCase_  ,				UpperCamelCase_				):
		# Checks if the entire collection has been sorted
		if len(UpperCamelCase_				) <= 1 or n <= 1:
				return

		insert_next(UpperCamelCase_  ,				n - 1				)
		rec_insertion_sort(UpperCamelCase_  ,				n - 1				)



def 						_lowerCAmelCase				(				UpperCamelCase_  ,				UpperCamelCase_				):
		# Checks order between adjacent elements
		if index >= len(UpperCamelCase_				) or collection[index - 1] <= collection[index]:
				return

		# Swaps adjacent elements since they are not in ascending order
		__SCREAMING_SNAKE_CASE       ,__SCREAMING_SNAKE_CASE            = (
		    collection[index],
		    collection[index - 1],
		)

		insert_next(UpperCamelCase_  ,				index + 1				)


if __name__ == "__main__":
							__magic_name__       =			input("Enter integers separated by spaces: ")
							__magic_name__       =			[int(num) for num in numbers.split()]
							rec_insertion_sort(number_list, len(number_list))
							print(number_list)







import os
def      a      (			A__	:   str = "input.txt"     )    ->      int:





      """simple docstring"""



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

      _lowercase	       =len(A__     )
      _lowercase	       =len(matrix[0]     )

      _lowercase	       =[[-1 for _ in range(A__     )] for _ in range(A__     )]
      for i in range(A__     ):
            _lowercase	       =matrix[i][0]

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

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


