from functools import lru_cache
N=6
A=tuple(tuple(map(int,input().split())) for i in range(N))
M=max(A[i][j] for i in range(N) for j in range(N))
def move(A,a):
    retu=[[A[i][j] for j in range(N)] for i in range(N)]
    I=[]
    J=[]
    for i in range(N):
        for j in range(N):
            if A[i][j]==a:
                I.append(i)
                J.append(j)
    retu=[]
    if J[0]==J[-1]:
        for di in (-1,1):
            B=[[A[i][j] for j in range(N)] for i in range(N)]
            dj=0
            ok=True
            for i,j in zip(I,J):
                B[i][j]=0
            for i,j in zip(I,J):
                if 0<=i+di<N and 0<=j+dj<N and A[i+di][j+dj] in (0,a):
                    B[i+di][j+dj]=A[i][j]
                else:
                    ok=False
            if ok:
                retu.append(B)
    else:
        for dj in (-1,1):
            B=[[A[i][j] for j in range(N)] for i in range(N)]
            di=0
            ok=True
            for i,j in zip(I,J):
                B[i][j]=0
            for i,j in zip(I,J):
                if 0<=i+di<N and 0<=j+dj<N and A[i+di][j+dj] in (0,a):
                    B[i+di][j+dj]=A[i][j]
                else:
                    ok=False
            if ok:
                retu.append(B)
    return retu
            


@lru_cache(maxsize=None)
def solve(A,cnt):
    if cnt<=1:
        return -1
    if A[2][5]==1 and A[2][4]==1:
        return cnt-2
    retu=-1
    for a in range(1,M+1):
        for B in move(A,a):
            for i in range(N):
                B[i]=tuple(B[i])
            B=tuple(B)
            retu=max(retu,solve(B,cnt-1))
    return retu


ans=solve(A,10)
if ans!=-1:
    ans=10-ans
print(ans)