// bzoj1085#include<algorithm>#include<iostream>#include<cstdlib>#include<cstring>#include<cstdio>#include<cmath>#include<queue>#define LL long long#define inf 2147483640#define Pi acos(-1.0)#define free(a) freopen(a".in","r",stdin),freopen(a".out","w",stdout);using namespace std;int ans[5][5]={{1,1,1,1,1},			   {0,1,1,1,1},			   {0,0,2,1,1},			   {0,0,0,0,1},			   {0,0,0,0,0}};int xx[8]={1,2,2,1,-1,-2,-2,-1};int yy[8]={2,1,-1,-2,-2,-1,1,2};int a[5][5],d,flag;char ch[10];bool judge() {	for (int i=0;i<5;i++)		for (int j=0;j<5;j++) if (a[i][j]!=ans[i][j]) return 0;	return 1;}bool eva(int s) {	int cnt=-1;	for (int i=0;i<5;i++)		for (int j=0;j<5;j++) if (a[i][j]!=ans[i][j]) if (++cnt==d-s) return 0;	return 1;}void dfs(int s,int x,int y) {	if (s==d) {if (judge()) flag=1;return;}	for (int i=0;i<8;i++) {		int nx=x+xx[i],ny=y+yy[i];		if (nx<0 || nx>4 || ny<0 || ny>4) continue;		swap(a[x][y],a[nx][ny]);		if (eva(s)) dfs(s+1,nx,ny);		if (flag) return;		swap(a[x][y],a[nx][ny]);	}}int main() {	int T;scanf("%d",&T);	while (T--) {		int x,y;flag=0;		for (int i=0;i<5;i++) {			scanf("%s",ch);			for (int j=0;j<5;j++) {				if (ch[j]==‘*‘) a[i][j]=2,x=i,y=j;				else a[i][j]=ch[j]-‘0‘;			}		}		for (d=0;d<=15;d++) {			dfs(0,x,y);			if (flag) {printf("%d\n",d);break;}		}		if (!flag) puts("-1");	}	return 0;}