1 #include<iostream>
 2 #include<cstdlib>
 3 #include<cmath>
 4 #include<cstring>
 5 #include<cstdio>
 6 #include<algorithm>
 7 #include<string>
 8 #include<map>
 9 #include<queue>
10 #include<vector>
11 #include<set>
12 #define inf 1000000000
13 #define maxn 10000+5
14 #define maxm 10000+5
15 #define eps 1e-10
16 #define ll long long
17 #define for0(i,n) for(int i=0;i<=(n);i++)
18 #define for1(i,n) for(int i=1;i<=(n);i++)
19 #define for2(i,x,y) for(int i=(x);i<=(y);i++)
20 #define for3(i,x,y) for(int i=(x);i>=(y);i--)
21 #define for4(i,x) for(int i=head[x],y=e[i].go;i;i=e[i].next,y=e[i].go)
22 using namespace std;
23 int read(){
24     int x=0,f=1;char ch=getchar();
25     while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
26     while(ch>='0'&&ch<='9'){x=10*x+ch-'0';ch=getchar();}
27     return x*f;
28 }
29 int T,k;
30 int ans[5][5]={{1,1,1,1,1},
31     {0,1,1,1,1},
32     {0,0,2,1,1},
33     {0,0,0,0,1},
34     {0,0,0,0,0}};
35 int xx[8]={1,1,-1,-1,2,2,-2,-2},yy[8]={2,-2,2,-2,1,-1,1,-1},flag=0;
36 int judge(int a[5][5]){
37     for(int i=0;i<5;i++)
38         for(int j=0;j<5;j++)
39             if(ans[i][j]!=a[i][j])return 0;
40     return 1;
41 }
42 int eva(int a[5][5],int s){
43     int v=0;
44     for(int i=0;i<5;i++)
45         for(int j=0;j<5;j++)
46             if(a[i][j]!=ans[i][j]){v++;if(v+s>k)return 0;}
47     return 1;
48 }
49 void search(int s,int a[5][5],int x,int y){
50     if(s==k){if(judge(a))flag=1;return;}
51     if(flag==1)return;
52     for(int i=0;i<8;i++){
53         int nowx=x+xx[i],nowy=y+yy[i];
54         if(nowx<0||nowx>4||nowy<0||nowy>4)continue;
55         swap(a[x][y],a[nowx][nowy]);
56         if(eva(a,s))search(s+1,a,nowx,nowy);
57         swap(a[x][y],a[nowx][nowy]);
58     }
59 }
60 int main(){
61     //freopen("input.txt","r",stdin);
62     //freopen("output.txt","w",stdout);
63     T=read();
64     for1(l,T){
65         int a[5][5],x,y;
66         memset(a,0,sizeof(a));
67         for(int i=0;i<5;i++){
68             char ch[10];scanf("%s",ch);
69             for(int j=0;j<5;j++){
70                 if(ch[j]=='*'){a[i][j]=2;x=i;y=j;}
71                 else a[i][j]=ch[j]-'0';
72             }
73         }
74         for(k=1;k<=15;k++)
75             {search(0,a,x,y);if(flag){printf("%d\n",k);break;}}
76         if(!flag)printf("-1\n");
77         else flag=0;
78     }
79     return 0;
80 }