#include<iostream>#include<cstdlib>#include<cstring>#include<cstdio>#include<cmath>using namespace std;int a[8][8], b[8][8];int counted(int i, int j){ int cnt = 0; if(b[i][j]) cnt++; if(b[i-1][j]) cnt++; if(b[i][j+1]) cnt++; if(b[i][j-1]) cnt++; return cnt;}int DFS(){ for(int i = 1; i <= 4; i++) for(int j = 1; j <= 6; j++) { int cnt = counted(i, j); if(cnt % 2 == a[i][j]) b[i+1][j] = 0; else b[i+1][j] = 1; } for(int i = 1; i <= 6; i++) { int cnt = counted(5, i); if(cnt % 2 != a[5][i]) return 0; } return 1;}void light() { for(int i = 0; i < 2; i++) { b[1][1] = i; for(int i1 = 0; i1 < 2; i1++) { b[1][2] = i1; for(int i2 = 0; i2 < 2; i2++) { b[1][3] = i2; for(int i3 = 0; i3 < 2; i3++) { b[1][4] = i3; for(int i4 = 0; i4 < 2; i4++) { b[1][5] = i4; for(int i5 = 0; i5 < 2; i5++) { b[1][6] = i5; int flag = DFS(); if(flag) return ; } } } } } } puts("8");}int main(){ int t, num = 0; scanf("%d", &t); while(t--) { for(int i = 1; i <= 5; i++) for(int j = 1; j <= 6; j++) scanf("%d", &a[i][j]); for(int i = 0; i < 8; i++) for(int j = 0; j < 8; j++) b[i][j] = 0; printf("PUZZLE #%dn",++num); light(); for(int i = 1; i <= 5; i++) for(int j = 1; j <= 6; j++) printf("%d%c", b[i][j], j != 6 ?' ':'n'); } return 0;}
