import java.util.Scanner;

public class Solution {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int[][] s = new int[3][3];
		for(int i = 0; i < 3; i++) {
			for(int j = 0; j < 3; j++) {
				s[i][j] = in.nextInt();
			}
		}
		in.close();
		
		int[][][] possibleMatrices = new int[][][] 
		{
			{
				{8, 1, 6},
				{3, 5, 7},
				{4, 9, 2}
			},
			{
				{4, 3, 8},
				{9, 5, 1},
				{2, 7, 6}
			},
			{
				{2, 9, 4},
				{7, 5, 3},
				{6, 1, 8}
			},
			{
				{6, 7, 2},
				{1, 5, 9},
				{8, 3, 4}
			},
			{
				{6, 1, 8},
				{7, 5, 3},
				{2, 9, 4}
			},
			{
				{8, 3, 4},
				{1, 5, 9},
				{6, 7, 2}
			},
			{
				{4, 9, 2},
				{3, 5, 7},
				{8, 1, 6}
			},
			{
				{2, 7, 6},
				{9, 5, 1},
				{4, 3, 8}
			}
		};
		
		int bestCost = Integer.MAX_VALUE;
		for(int i = 0; i < 8; i++) {
			int[][] matrix = possibleMatrices[i];
			int cost = 0;
			for(int row = 0; row < 3; row++) {
				for(int col = 0; col < 3; col++) {
					cost += Math.abs(s[row][col] - matrix[row][col]);
				}
			}
			if(cost < bestCost)
				bestCost = cost;
		}
		System.out.println(bestCost);
	}
}