#include<cstdio>

#include<cstdlib>

#include<cstring>

#include<cmath>

#include<iostream>

#include<algorithm>

using namespace std;

const int N = ;

int a[N][N], ans[N];

int dx[] = { ,,,-, };

int dy[] = { ,,,,- };

int idx(int x, int y) { return (x - ) *  + y; }

void Gauss()

{

    int i, j, k, l;

    memset(ans, , sizeof(ans));

    for (i = , j = ; i <=  && j <= ; j++)

    {

        for (k = i; k <= ; k++)

            if (a[k][j]) break;

        if (a[k][j])

        {

            for (l = ; l <= ; l++) swap(a[i][l], a[k][l]);

            for (l = ; l <= ; l++)     //debug从1开始（回代）

            {

                if (l != i && a[l][j])

                    for (k = ; k <= ; k++)

                        a[l][k] ^= a[i][k];           //高斯消元的^异或运算；

            }

            i++;

        }

    }

    for (int j = ; j<i; j++) ans[j] = a[j][];

}

int main()

{

    int x, y, T, cas = ;

    scanf("%d", &T);

    while (T--)

    {

        memset(a, , sizeof(a));

        for (int i = ; i <= ; i++)

            for (int j = ; j <= ; j++)

            {

                scanf("%d", &a[idx(i, j)][]);      //这里是将该矩阵按列线性存储

                for (int k = ; k <= ; k++)

                {

                    x = i + dx[k]; y = j + dy[k];

                    if (x> || y> || x< || y<) continue;

                    a[idx(i, j)][idx(x, y)] = ;       //将这个点周围四个点全部置为1

                }

            }

        for (int i = ; i <= ; i++) a[i][i] = ;

        Gauss();

        printf("PUZZLE #%d\n", ++cas);

        for (int i = ; i <= ; i++)

        {

            printf("%d ", ans[i]);

            if (i %  == ) printf("\n");

        }

    }

    return ;

}