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


int main ()
{
	std::vector <int> digits (9, 0);
	for (int i = 0; i < 9; i++)
		std::cin >> digits [i];

	// there are 8 possible squares
	std::vector <std::vector <int>> variants =
	{
		{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}
	};

	size_t min_price = 1000;
	for (int i = 0; i < 8; i++)
	{
		int cur_price = 0;
		std::vector <int> variant = variants[i];
		for (int j = 0; j < 9; j++)
		{
			if (digits [j] != variant [j])
				cur_price += std::abs (digits [j] - variant [j]);
		}

		if (cur_price < min_price)
			min_price = cur_price;
	}

	std::cout << min_price;
	
	return 0;
}