#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>using namespace std;const int MaxStep = 15;
const int Dx[8] = {1, 1, -1, -1, 2, 2, -2, -2}, Dy[8] = {2, -2, 2, -2, 1, -1, 1, -1};int Te, Ans;char Str[6];struct ES
{int num, pos;bool operator == (const ES &e) const {return (num == e.num) && (pos == e.pos);}
} S, T;inline bool Inside(int x, int y) {if (x < 0 || x > 4) return false;if (y < 0 || y > 4) return false;return true;
}void Print(ES x) {for (int i = 0; i < 5; ++i) {for (int j = 0; j < 5; ++j) {if (x.pos == (i * 5 + j)) printf("*");else {if (x.num & (1 << (i * 5 + j))) printf("1");else printf("0");}}printf("\n");}
}inline int Expect(ES x) {int Temp, Cnt;Temp = x.num ^ T.num;Cnt = 0;if (x.pos != T.pos) {if (Temp & (1 << T.pos)) --Cnt;if (Temp & (1 << x.pos)) --Cnt;}while (Temp) {++Cnt;Temp -= Temp & -Temp;}return Cnt;
}bool DFS(ES Now, int Step, int Limit) {if (Now == T) return true;if (Step == Limit) return false;if (Expect(Now) > Limit - Step) return false;int x, y, xx, yy;ES Next;x = Now.pos / 5; y = Now.pos % 5;for (int i = 0; i < 8; i++) {xx = x + Dx[i]; yy = y + Dy[i];if (!Inside(xx, yy)) continue;Next = Now; Next.pos = xx * 5 + yy;Next.num &= (1 << 25) - 1 - (1 << (xx * 5 + yy));if (Now.num & (1 << (xx * 5 + yy))) Next.num |= (1 << (x * 5 + y)); if (DFS(Next, Step + 1, Limit)) return true;}return false;
}int IDAStar(ES S) {if (S == T) return 0;for (int i = 1; i <= MaxStep; ++i) if (DFS(S, 0, i)) return i;return -1;
}int main()
{scanf("%d", &Te);T.num = 549855; T.pos = 12;for (int Case = 1; Case <= Te; ++Case) {S.num = 0;for (int i = 0; i < 5; ++i) {scanf("%s", Str);for (int j = 0; j < 5; ++j) {if (Str[j] == '1') S.num |= (1 << (i * 5 + j));if (Str[j] == '*') S.pos = i * 5 + j;}}Ans = IDAStar(S);printf("%d\n", Ans);} return 0;
}