#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<map>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<queue>
using namespace std;

const int mx = 1e5 + 5;
const int inf = 1e9;

char a[7][7];
int tmp[7][7];

inline void click(int i, int j){
    tmp[i][j] ^= 1;
    tmp[i+1][j] ^= 1;
    tmp[i-1][j] ^= 1;
    tmp[i][j+1] ^= 1;
    tmp[i][j-1] ^= 1;
}

int main(){
    int t; cin >> t;
    while(t--){
        
        for(int i = 1; i <= 5; i++) scanf("%s", a[i]+1);
        
        int ans = inf, cnt = 0;
        for(int S = 0; S < (1<<5); S++){
            cnt = 0;
            for(int i = 1; i <= 5; i++){
                for(int j = 1; j <= 5; j++) tmp[i][j] = a[i][j] - ‘0‘;
            }
            
            for(int i = 0; i < 5; i++){
                if(S & (1<<i)) click(1, i+1), cnt++;
            }
            
            for(int i = 1; i <= 4; i++){
                for(int j = 1; j <= 5; j++){
                    if(!tmp[i][j]) click(i+1, j), cnt++;
                }
            }
            
            int flag = 0;
            for(int i = 1; i <= 5; i++){
                for(int j = 1; j <= 5; j++) if(!tmp[i][j]) flag = 1;
            }
            
            if(!flag) ans = min(ans, cnt);
        }
        if(ans > 6) {
            printf("-1\n"); continue;
        }
        printf("%d\n", ans);
    }
    
    
    return 0;
}