


'''simple docstring'''
import os


def 			a      (			__a = "input.txt"   )  ->	int:



					'''simple docstring'''






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

					UpperCamelCase__   :Any												= len(__a   )
					UpperCamelCase__   :Optional[Any]												= len(matrix[0]   )

					UpperCamelCase__   :Any												= [[-1 for _ in range(__a   )] for _ in range(__a   )]
					for i in range(__a   ):
										UpperCamelCase__   :List[Any]												= matrix[i][0]

					for j in range(1 ,					__a   ):
										for i in range(__a   ):
															UpperCamelCase__   :List[Any]												= minimal_path_sums[i][j - 1] + matrix[i][j]

										for i in range(1 ,					__a   ):
															UpperCamelCase__   :List[str]												= min(
															    minimal_path_sums[i][j] ,					minimal_path_sums[i - 1][j] + matrix[i][j]   )

										for i in range(rows - 2 ,					-1 ,					-1   ):
															UpperCamelCase__   :List[Any]												= 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() = }""")



'''simple docstring'''
def 			a      (			__a ,					__a   )  ->	int:



					'''simple docstring'''






					if len(__a   ) != len(__a   ):
										raise ValueError('''String lengths must match!'''   )

					UpperCamelCase__   :Union[str, Any]												= 0

					for chara, chara in zip(__a ,					__a   ):
										if chara != chara:
															count += 1

					return count


if __name__ == "__main__":
		import doctest

		doctest.testmod()