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[][] a=new int[3][3];
    
    int ini=-1,inj=-1;
    int small;
   
    for(int i=0;i<3;i++){
        for(int j=0;j<3;j++){
            a[i][j]=in.nextInt();
           /* if(a[i][j]==1 && Math.abs(i-j)==1){
                ini=i;
                inj=j;
            }*/
        }
    }
        /*
    int cost=0;
    if(ini==-1 || inj==-1){ //'1' no present in array
        
       small=a[0][1];
        ini=0;inj=1;
       if(small>a[1][0]){
            small=a[1][0];
           ini=1;
           inj=0;
       }
       if(small>a[1][2]){
            small=a[1][2];
           ini=1;
           inj=2;
       }
        if(small>a[2][1]){
            small=a[2][1];
            ini=2;
           inj=1;
        }
      cost=cost+a[ini][inj]-1;
        a[ini][inj]=1;
    } 
    int x1[]={2,7,6,9,5,1,4,3,8};
    int x2[]={4,9,2,3,5,7,8,1,6};
    int x3[]={6,1,8,7,5,3,2,9,4};
    int x4[]={8,3,4,1,5,6,6,7,2};
    int[] x= new int[9];
    
   // cout<<ini<<inj<<"\n";
    if(ini==1 && inj==2){
      
        x=Arrays.copyOf(x1,x1.length);
       
    }
    else if(ini==2 && inj==1)
       x=Arrays.copyOf(x2,x2.length);
      
    
    else if(ini==0 && inj==1)
        x=Arrays.copyOf(x3,x3.length);
 
    
    else if(ini==1 && inj==0)
        x=Arrays.copyOf(x4,x4.length);


   
     int k=0;
    
     for(int i=0;i<3;i++){
         
        for(int j=0;j<3;j++){
           
            if(a[i][j]!=x[k]){
                cost=cost+(Math.abs(x[k]-a[i][j]));
               
            }
            k++; 
        }
    }*/
        int x[][]={{2,7,6,9,5,1,4,3,8},
        {4,9,2,3,5,7,8,1,6},
        {6,1,8,7,5,3,2,9,4},
        {8,3,4,1,5,9,6,7,2},
        {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}};
    
        int cost=0;
        int costSmall=Integer.MAX_VALUE;
        int k=0,n=0;
        while(k<8){
            n=0;
            cost=0;
            while(n<9){
                                         
                 for(int i=0;i<3;i++){

                    for(int j=0;j<3;j++){
                        if(a[i][j]!=x[k][n]){
                            cost=cost+(Math.abs(x[k][n]-a[i][j]));
                        }
                        n++;     
                    }
                 }
                
            }
            if(k==0 && n==0)
                costSmall=cost;
            if(cost<costSmall)
                costSmall=cost;
            k++;
        }
        
        
        System.out.println(costSmall);
    } 
}