#include <algorithm>  // for abs()
#include <iostream>
#include <vector>
using namespace std;

vector<vector<int>> v{{8, 1, 6, 3, 5, 7, 4, 9, 2}, {4, 3, 8, 9, 5, 1, 2, 7, 6},
					  {2, 9, 4, 7, 5, 3, 6, 1, 8}, {6, 7, 2, 1, 5, 9, 8, 3, 4},
					  {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}, {2, 7, 6, 9, 5, 1, 4, 3, 8}};

int differences(int s[9], int &closest, int minDifferences = -1) {
	for (int i = 0, numDifferences; i < v.size(); i++) {
		numDifferences = 0;
		for (int j = 0; j < 9; j++)
			if (s[j] != v[i][j])
				numDifferences += abs(s[j] - v[i][j]);

		if (!numDifferences)
			return 0;

		if (i == 0 || numDifferences < minDifferences)
			minDifferences = numDifferences, closest = i;
	}

	return minDifferences;
}

int doChanges(int s[9]) {
	int closest;
	return differences(s, closest);
}

int main() {
	int s[9];
	for (int i = 0; i < 9; i++)
		cin >> s[i];

	cout << doChanges(s) << endl;
}