//find least cost of abs values to fix given input to become 3x3 magic square
import java.io.*;
import java.util.*;

public class MagicSquare3x3HardCode {

    public static void main(String[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
      
      // corners must be: 4, 2, 8 6
      // center must b 5
      //n/s/e/w sides must be 9 7, 3, 1
      // opposites sum to 10
      
      //read in data - into an int array -- use 1- 9 for convention
      
      //int[][]master;// =new int[9][9]; 
      
      
     int[][]master=
      {
      {2,7,6,
      9,5,1,
      4,3,8},
      
      {2,9,4,
      7,5,3,
      6,1,8},
   
      {4,3,8,
      9,5,1,
      2,7,6},
        
      {4,9,2,
      3,5,7,
      8,1,6},
      
      {6,1,8,
      7,5,3,
      2,9,4},

      {6,7,2,
      1,5,9,
      8,3,4},
            
      {8,1,6,
       3,5,7,
      4,9,2}, 
      
      {8,3,4,
      1,5,9,
      6,7,2}   };
      
      Scanner in = new Scanner(System.in);
      int m[]=new int [9];
      for(int x=0; x<m.length; x++)
      {
        m[x] = in.nextInt();
        
      }
      int cost=0;
      // check center for 5
      if (m[4]!=5)
      { 
         cost+= Math.abs(5-m[4]);
         m[4]=5;
      }
      
      int[]costs= new int[8];
      //int mincosts=0;
      int mincostsIndex = 0;
      int x =0;
      for( x=0; x<costs.length; x++)
      {
         for(int i=0; i<m.length; i++)
         {
            costs[x]+= Math.abs(m[i]-master[x][i]);
         
         }
         if (costs[x]<costs[mincostsIndex])
         {
            mincostsIndex=x;
         }
           
      }
      
       System.out.println(costs[mincostsIndex]+cost);

      
      /*
      //diagonals
      if ( m[1]+m[9]!=10){
        
        
      }
      if (m[3]+ m[7]!=10){
        
      }
        
        //n/s
         if ( m[1]+m[9]!=10){
           
         }
        
        //e/w
      if (m[3]+ m[7]!=10)
      for(int x=1; x<m.length; x++)
        {
        if(x%3==1) System.out.println();
        
        System.out.print(m[x] +" ");
        
      }*/
        
    }
}