#include <bits/stdc++.h>
using namespace std;
#define forl(i,x,y) for(int i=x;i<y;++i)

int main() {
  int CASE = 8;
  int TOTAL = 9;
  int arr[TOTAL];
  
  forl(i,0,TOTAL) {
    int n; scanf("%d",&n);
    arr[i] = n;
  }

  int cases[CASE][TOTAL] = {
    {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 min = 46;
  forl(r,0,CASE) {
    int count = 0;
    forl(c,0,TOTAL) {
      count += abs(cases[r][c] - arr[c]);
    }
    if (count < min) min = count;
  }
  printf("%d",min);
  return 0;
}