#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <climits>
using namespace std;


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    vector<vector<int> > s(3,vector<int>(3));
    vector<int> v(8);
    int f;
    for(int i=0;i<3;i++){
        for(int j=0;j<3;j++){
            cin>>f;
            s[i][j]=f;
        }        
    }
    for(int i=0;i<3;i++){
        v[i]=s[0][i];
    }
    v[3]=s[1][2]; v[4]=s[2][2]; v[5]=s[2][1]; v[6]=s[2][0]; v[7]=s[1][0];
    /*for(int i=0;i<8;i++){
        cout<<v[i]<<",";
    }cout<<"\n";*/
    int a[]={8,1,6,7,2,9,4,3};
    int cost=INT_MAX,d=0;
    for(int i=0;i<8;i+=2){
        int k=0;    d=0;
        for(int j=i;j<i+8;j++){
            d+=abs(a[j%8]-v[k++]);       
            
        }
        if(cost>d){
                cost=d;
           }
    }
    for(int i=8;i>0;i-=2){
        int k=0;    d=0;
        for(int j=i;j>i-8;j--){
            d+=abs(a[(j+8)%8]-v[k++]);   //cout<<a[(j+8)%8]<<", "<<v[k-1]<<"\t";
            
        }   //cout<<d<<", ";
        if(cost>d){
                cost=d;
            }
    }
    if(s[1][1]!=5){
        d=abs(s[1][1]-5);
        cost+=d;
    }
    
        cout<<cost;
    /*vector<vector<int> > v(3,vector<int>(3));
    int a,f;//sum=0;
    vector<int> dup(9);
    for(int i=0;i<3;i++){
       
        for(int j=0;j<3;j++){
            cin>>a;
            v[i][j]=a;
            //sum+=a;
            dup[a]++;
        }
        
    }
    //int cost=abs(45-sum);
    f=v[0][0];
    int cost=0;
    if(f==8){
        int t1[][3]={ {8,1,6}, {3,5,7}, {4,9,2} };
        for(int i=0;i<3;i++){
            for(int j=0;j<3;j++){
                int c1=abs(t1[i][j]-v[i][j]);
                //int c2=abs(t1[j][i]-v[j][i]);
                //if(c1!=c2)
                    cost=c1;//cost+min(c1,c2);
                v[i][j]=t1[i][j];
                //v[j][i]=t1[j][i];
            }
        }
    }
    else if(f==4){
        int t1[][3]={ {4,9,2}, {3,5,7}, {8,1,6} };
        for(int i=0;i<3;i++){
            for(int j=0;j<3;j++){
                int c1=abs(t1[i][j]-v[i][j]);
                //int c2=abs(t1[j][i]-v[j][i]);
                //if(c1!=c2)
                    cost=c1;//cost+min(c1,c2);
                v[i][j]=t1[i][j];
                //v[j][i]=t1[j][i];
            }
        }
    }
    else if(f==6){
        int t1[][3]={ {6,1,8}, {7,5,3}, {2,9,4} };
        for(int i=0;i<3;i++){
            for(int j=0;j<3;j++){
                int c1=abs(t1[i][j]-v[i][j]);
                //int c2=abs(t1[j][i]-v[j][i]);
                //if(c1!=c2)
                    cost=c1;//cost+min(c1,c2);
                v[i][j]=t1[i][j];
                //v[j][i]=t1[j][i];
            }
        }
    }
    else if(f==2){
        int t1[][3]={ {2,9,4}, {7,5,3}, {6,1,8} };
        for(int i=0;i<3;i++){
            for(int j=0;j<3;j++){
                int c1=abs(t1[i][j]-v[i][j]);
                //int c2=abs(t1[j][i]-v[j][i]);
                //if(c1!=c2)
                    cost=c1;//cost+min(c1,c2);
                v[i][j]=t1[i][j];
                //v[j][i]=t1[j][i];
            }
        }
    }
    cout<<cost;*/
    return 0;
}