import java.io.*;
import java.util.*;

class Solution {

    public static void main(String[] args) {
      Scanner sc=new Scanner(System.in);
      int a[][] ={
        {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},
        {6, 7, 2, 1, 5, 9, 8, 3, 4},
        {2, 7, 6, 9, 5, 1, 4, 3, 8},
        {4, 3, 8, 9, 5, 1, 2, 7, 6},
        {4, 9, 2, 3, 5, 7, 8, 1, 6},
        {2, 9, 4, 7, 5, 3, 6, 1, 8} };
     int b[]=new int[9];
     int i,j,minCost=0,cost;
     boolean k=false;
     for(i=0;i<9;i++)
     {
        b[i]=sc.nextInt();
     }
     for(j=0;j<8;j++)
     {
        cost=0;
        for(i=0;i<9;i++)
        {
           if(a[j][i]==b[i])
              ;
           else if(a[j][i]>b[i])
              cost=cost+(a[j][i]-b[i]);
           else
              cost=cost+(b[i]-a[j][i]);
        }
        if(!k)
        {
          minCost=cost;
          k=true;
        }
        else
        {
           if(minCost>cost)
             minCost=cost;
        }
     } 
     System.out.println(minCost);
    }
}