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


int main() {
    int vec[9];
    for(int i=0; i<9; i++){
        cin >> vec[i];
    }
    int arr[8][9] = {{8,1,6,3,5,7,4,9,2},
                   {6,1,8,7,5,3,2,9,4},
                   {4,9,2,3,5,7,8,1,6},
                   {2,9,4,7,5,3,6,1,8},
                   {8,3,4,1,5,9,6,7,2},
                   {4,3,8,9,5,1,2,7,6},
                   {6,7,2,1,5,9,8,3,4},
                   {2,7,6,9,5,1,4,3,8}};
    vector <int> cost_vec;
    int cost;
    int diff;
    for(int i=0; i<8; i++){
        cost = 0;
        for(int j=0; j<9; j++){
            if(vec[j] != arr[i][j]){
                (vec[j]>arr[i][j]) ? (cost += (vec[j] - arr[i][j])) : (cost += (arr[i][j] - vec[j]));
            }
        }
        cost_vec.push_back(cost);
    }
    int min = 2147483647;
    for(int i=0; i<8; i++){
       if(cost_vec[i] < min)
           min = cost_vec[i];
    }
    cout << min << endl;
    return 0;
}