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


int main() {
    int values[] = {0,0,0,0,0,0,0,0};
    int thing[9];
    int a[] = {8,1,6,3,5,7,4,9,2};
    int b[] = {6,1,8,7,5,3,2,9,4};
    int c[] = {4,9,2,3,5,7,8,1,6};
    int d[] = {2,9,4,7,5,3,6,1,8};
    int e[] = {8,3,4,1,5,9,6,7,2};
    int f[] = {4,3,8,9,5,1,2,7,6};
    int g[] = {6,7,2,1,5,9,8,3,4};
    int h[] = {2,7,6,9,5,1,4,3,8};
    int min = 100;
    
    for (int i = 0; i<9;i++) {
        cin >> thing[i];
    }
    
    for (int j = 0;j<9;j++) {
        values[0] += abs(a[j]-thing[j]);
    }
    for (int j = 0;j<9;j++) {
        values[1] += abs(b[j]-thing[j]);
    }
    for (int j = 0;j<9;j++) {
        values[2] += abs(c[j]-thing[j]);
    }
    for (int j = 0;j<9;j++) {
        values[3] += abs(d[j]-thing[j]);
    }
    for (int j = 0;j<9;j++) {
        values[4] += abs(e[j]-thing[j]);
    }
    for (int j = 0;j<9;j++) {
        values[5] += abs(f[j]-thing[j]);
    }
    for (int j = 0;j<9;j++) {
        values[6] += abs(g[j]-thing[j]);
    }
    for (int j = 0;j<9;j++) {
        values[7] += abs(h[j]-thing[j]);
    }
    
    for (int k = 0;k<8;k++) {
        if (values[k] < min)
            min = values[k];
    }
    
    cout << min;
    return 0;
}