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


int main() {
    std::vector<std::vector<std::vector<int>>> possibilities = {
        {
            { 2, 9, 4 },
            { 7, 5, 3 },
            { 6, 1, 8 }
        },
        {
            { 4, 3, 8 },
            { 9, 5, 1 },
            { 2, 7, 6 }
        },
        {
            { 8, 1, 6 },
            { 3, 5, 7 },
            { 4, 9, 2 }
        },
        {
            { 6, 7, 2 },
            { 1, 5, 9 },
            { 8, 3, 4 }
        },
        {
            { 2, 7, 6 },
            { 9, 5, 1 },
            { 4, 3, 8 }
        },
        {
            { 6, 1, 8 },
            { 7, 5, 3 },
            { 2, 9, 4 }
        },
        {
            { 8, 3, 4 },
            { 1, 5, 9 },
            { 6, 7, 2 }
        },
        {
            { 4, 9, 2 },
            { 3, 5, 7 },
            { 8, 1, 6 }
        },
    };
    
    std::vector<std::vector<int>> test;
    
    for (int i = 0; i < 3; ++i) {
        test.push_back(std::vector<int>());
        
        for (int j = 0; j < 3; ++j) {
            int a;
            std::cin >> a;
            test.back().push_back(a);
        }
    }

    int min_cost = 100;
    
    for (int i = 0; i < 8; ++i) {
        int cost = 0;
        for (int j = 0; j < 3; ++j) {
            for (int k = 0; k < 3; ++k) {
                cost += abs(test[j][k] - possibilities[i][j][k]);
            }
        }
        
        if (cost < min_cost) {
            min_cost = cost;
        }
    }
    
    std::cout << min_cost << std::endl;
    return 0;
}