import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
       Scanner in = new Scanner(System.in);
		int square[][] = new int[3][3];
		for (int i = 0; i < 3; i++) {
			for (int j = 0; j < 3; j++) {
				square[i][j] = in.nextInt();
			}
		}
		in.close();
		int[][][] magicSquares = {{{4, 9, 2}, {3, 5, 7}, {8, 1, 6}},
				{{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}},
				{{2, 9, 4}, {7, 5, 3}, {6, 1, 8}},
				{{8, 1, 6}, {3, 5, 7}, {4, 9, 2}},
				{{4, 3, 8}, {9, 5, 1}, {2, 7, 6}}};

		int minCost = Integer.MAX_VALUE;
		for (int[][] magicSquare : magicSquares) {
			int tempCost = 0;
			for (int i = 0; i < magicSquare.length; i++) {
				for (int j = 0; j < magicSquare[i].length; j++) {
					tempCost += (square[i][j] - magicSquare[i][j] > 0) ? square[i][j] - magicSquare[i][j] : magicSquare[i][j] - square[i][j];
				}
			}
			if (tempCost < minCost) {
				minCost = tempCost;
			}
		}
		System.out.println(minCost);
    }
}