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) {
        Scanner in =  new Scanner(System.in);
        int []m1 = {8, 1, 6, 3, 5, 7, 4, 9, 2};
        int []m2 = {6, 1, 8, 7, 5, 3, 2, 9, 4};
        int []m3 = {4, 9, 2, 3, 5, 7, 8, 1, 6};
        int []m4 = {2, 9, 4, 7, 5, 3, 6, 1, 8};
        int []m5 = {8, 3, 4, 1, 5, 9, 6, 7, 2};
        int []m6 = {4, 3, 8, 9, 5, 1, 2, 7, 6};
        int []m7 = {6, 7, 2, 1, 5, 9, 8, 3, 4};
        int []m8 = {2, 7, 6, 9, 5, 1, 4, 3, 8};
      int [] n = new int [9];
        for(int i=0; i<9 ; i++)
            n[i] = in.nextInt();
        int min = 9 * 9;
        int cost = 0;
        for(int i=0; i<9 ; i++)
            cost += Math.abs(n[i]-m1[i]);
        if(cost<min)
            min =cost;
        cost = 0;
         for(int i=0; i<9 ; i++)
            cost += Math.abs(n[i]-m2[i]);
          if(cost<min)
            min =cost;
        cost = 0;
         for(int i=0; i<9 ; i++)
            cost += Math.abs(n[i]-m3[i]);
          if(cost<min)
            min =cost;
        cost = 0;
         for(int i=0; i<9 ; i++)
            cost += Math.abs(n[i]-m4[i]);
          if(cost<min)
            min =cost;
        cost = 0;
         for(int i=0; i<9 ; i++)
            cost += Math.abs(n[i]-m5[i]);
          if(cost<min)
            min =cost;
        cost = 0;
         for(int i=0; i<9 ; i++)
            cost += Math.abs(n[i]-m6[i]);
          if(cost<min)
            min =cost;
        cost = 0;
         for(int i=0; i<9 ; i++)
            cost += Math.abs(n[i]-m7[i]);
          if(cost<min)
            min =cost;
        cost = 0;
         for(int i=0; i<9 ; i++)
            cost += Math.abs(n[i]-m8[i]);
         if(cost<min)
            min =cost;
        
        System.out.print(min);
    }
}