





'''simple docstring'''




a__					:			Optional[int]          =     {
    '''a''': '''AAAAA''',
    '''b''': '''AAAAB''',
    '''c''': '''AAABA''',
    '''d''': '''AAABB''',
    '''e''': '''AABAA''',
    '''f''': '''AABAB''',
    '''g''': '''AABBA''',
    '''h''': '''AABBB''',
    '''i''': '''ABAAA''',
    '''j''': '''BBBAA''',
    '''k''': '''ABAAB''',
    '''l''': '''ABABA''',
    '''m''': '''ABABB''',
    '''n''': '''ABBAA''',
    '''o''': '''ABBAB''',
    '''p''': '''ABBBA''',
    '''q''': '''ABBBB''',
    '''r''': '''BAAAA''',
    '''s''': '''BAAAB''',
    '''t''': '''BAABA''',
    '''u''': '''BAABB''',
    '''v''': '''BBBAB''',
    '''w''': '''BABAA''',
    '''x''': '''BABAB''',
    '''y''': '''BABBA''',
    '''z''': '''BABBB''',
    ''' ''': ''' ''',
}


a__					:			Optional[int]          =     {value: key for key, value in encode_dict.items()}




def 						__lowerCamelCase			(	UpperCAmelCase_							)   ->str:
	snake_case__	       =   ''
	for letter in word.lower():
		if letter.isalpha() or letter == " ":
			encoded += encode_dict[letter]
		else:
			raise Exception('encode() accepts only letters of the alphabet and spaces'							)
	return encoded




def 						__lowerCamelCase			(	UpperCAmelCase_							)   ->str:
	if set(UpperCAmelCase_							) - {"A", "B", " "} != set():
		raise Exception('decode() accepts only \'A\', \'B\' and spaces'							)
	snake_case__	       =   ''
	for word in coded.split():
		while len(UpperCAmelCase_							) != 0:
			decoded += decode_dict[word[:5]]
			snake_case__	       =   word[5:]
		decoded += " "
	return decoded.strip()


if __name__ == "__main__":
			from doctest import testmod

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



