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

int main() {
    int cube[3][3];
    int price =0;
    for(int i =0; i < 3;i++) {
        
        for(int e = 0; e < 3; e++) {
            cin >> cube[i][e];
        }
    }
    int magic[8][3][3] = {
        { {8,1,6},{3,5,7},{4,9,2}},
        { {6,1,8},{7,5,3},{2,9,4}},
        { {4,3,8},{9,5,1},{2,7,6}},
        { {2,7,6},{9,5,1},{4,3,8}},
        { {2,9,4},{7,5,3},{6,1,8}},
        { {4,9,2},{3,5,7},{8,1,6}},
        { {6,7,2},{1,5,9},{8,3,4}},
        { {8,3,4},{1,5,9},{6,7,2}}
    };
    int minimalChange = 100000;
    for(int i = 0; i < 8;i++) {
        int tempPrice = 0;
        for(int e = 0; e < 3;e++) {
            for(int k = 0; k < 3;k++) {
                int b = magic[i][e][k];
                int a = cube[e][k];
                tempPrice += abs(a - b);
            }
        }
        if(tempPrice < minimalChange) {
            minimalChange = tempPrice;
        }
    }
    cout << minimalChange;
    return 0;
}