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

int cost(int a[3][3], int m[3][3] ){
    int cost = 0;
    for(int i = 0; i < 3; i++){
        for(int j = 0; j < 3; j++){
            if(a[i][j] != m[i][j]){
                cost+= abs(a[i][j] - m[i][j]);
            }
        }
    }
    return cost;
}

int m[8][3][3] = {
        {{8,1,6},{3,5,7},{4,9,2}},
        {{6,1,8},{7,5,3},{2,9,4}},
        {{8,3,4},{1,5,9},{6,7,2}},
        {{6,7,2},{1,5,9},{8,3,4}},
        {{4,9,2},{3,5,7},{8,1,6}},
        {{2,9,4},{7,5,3},{6,1,8}},
        {{2,7,6},{9,5,1},{4,3,8}},
        {{4,3,8},{9,5,1},{2,7,6}}
};

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int a[3][3];
    for(int i=0;i<3;i++){
        for(int j = 0;j<3;j++)
            cin>>a[i][j];
    }
    int c = cost(a,m[0]);
    for(int i = 1; i < 8; i++){
        c = min(c, cost(a,m[i]));
    }
    cout << c <<'\n';
    return 0;
}