



"""simple docstring"""


def  _lowerCAmelCase      (   ):
						UpperCAmelCase             = []
						UpperCAmelCase             = 1

						while len(lowercase_						) < 1e6:
												constant.append(str(lowercase_						)						)
												i += 1

						UpperCAmelCase             = ''.join(lowercase_						)

						return (
						    int(constant[0]						)
						    * int(constant[9]						)
						    * int(constant[99]						)
						    * int(constant[999]						)
						    * int(constant[9999]						)
						    * int(constant[99999]						)
						    * int(constant[999999]						)
						)


if __name__ == "__main__":
				print(solution())








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() = }")


