import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
        Scanner in = new Scanner(System.in);
        int[][] square = new int[3][3];
        int[][][] magicSquares = 
       { { {8, 1, 6}, {3, 5, 7}, {4, 9, 2} },
         { {6, 1, 8}, {7, 5, 3}, {2, 9, 4} },
         { {4, 9, 2}, {3, 5, 7}, {8, 1, 6} },
         { {2, 9, 4}, {7, 5, 3}, {6, 1, 8} },
         { {8, 3, 4}, {1, 5, 9}, {6, 7, 2} },
         { {4, 3, 8}, {9, 5, 1}, {2, 7, 6} },
         { {6, 7, 2}, {1, 5, 9}, {8, 3, 4} },
         { {2, 7, 6}, {9, 5, 1}, {4, 3, 8} }};
        
        for(int row=0; row<3; row++) {
            for(int col=0; col<3; col++) {
                square[row][col] = in.nextInt();
            }
            if(row < 2) {
                in.nextLine();
            }
        }
        
        int[] cost = new int[8];
        
        for(int i=0; i<8; i++) {
            for(int row=0; row<3; row++) {
                for(int col=0; col<3; col++) {
                    if(square[row][col] != magicSquares[i][row][col]) {
                        cost[i] += Math.abs(square[row][col] - magicSquares[i][row][col]);
                    }
                }
            }
        }
        
        int lowest = cost[0];
        for(int i=1; i<8; i++) {
            if(cost[i] < lowest) {
                lowest = cost[i];
            }
        }
        
        System.out.println(lowest);
    }
}