//  https://www.hackerrank.com/contests/rookierank/challenges/magic-square-forming

#include <cstdio>
#include <cstdlib>

int main()
{
    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 m[12];

    int i;
    for(i=0;i<9;i++)
        scanf("%d", &m[i]);
    int min=100;
    int omil=0;
    for(i=0;i<9;i++)
        if(m[i]!=m1[i])
        omil+=abs(m[i]-m1[i]);
    if(omil<min)
        min=omil;
    omil=0;
    for(i=0;i<9;i++)
        if(m[i]!=m2[i])
        omil+=abs(m[i]-m2[i]);
    if(omil<min)
        min=omil;
        omil=0;
    for(i=0;i<9;i++)
        if(m[i]!=m3[i])
        omil+=abs(m[i]-m3[i]);
    if(omil<min)
        min=omil;
        omil=0;
    for(i=0;i<9;i++)
        if(m[i]!=m4[i])
        omil+=abs(m[i]-m4[i]);
    if(omil<min)
        min=omil;
        omil=0;
    for(i=0;i<9;i++)
        if(m[i]!=m5[i])
        omil+=abs(m[i]-m5[i]);
    if(omil<min)
        min=omil;
        omil=0;
    for(i=0;i<9;i++)
        if(m[i]!=m6[i])
        omil+=abs(m[i]-m6[i]);
    if(omil<min)
        min=omil;
        omil=0;
    for(i=0;i<9;i++)
        if(m[i]!=m7[i])
        omil+=abs(m[i]-m7[i]);
    if(omil<min)
        min=omil;
        omil=0;
    for(i=0;i<9;i++)
        if(m[i]!=m8[i])
        omil+=abs(m[i]-m8[i]);
    if(omil<min)
        min=omil;

        printf("%d\n", min);

        return 0;
}