Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

var scanner = bufio.NewScanner(os.Stdin)
var (
	table, ans = [12][12]int{}, [12][12]int{}
)

func main() {
	scanner.Scan()
	n, _ := strconv.Atoi(scanner.Text())
	for i := 0; i < n; i++ {
		for j := 1; j < 11; j++ {
			scanner.Scan()
			input := strings.Split(scanner.Text(), " ")
			tmp := [10]int{}
			for k := range input {
				tmp[k], _ = strconv.Atoi(input[k])
			}
			for l := 1; l < 11; l++ {
				table[j][l] = tmp[l-1]
			}
		}
		check(table, 1, ans)
	}
}

func check(table [12][12]int, i int, ans [12][12]int) {
	if i == 11 {
		solve(table, 2, 1, ans)
		return
	}
	ans[1][i] = 0
	check(table, i+1, ans)
	ans[1][i] = 1
	attack(table, 1, i)
	check(table, i+1, ans)
	attack(table, 1, i)
}

func solve(table [12][12]int, i, j int, ans [12][12]int) {
	if i == 11 {
		flag := true
		for k := 1; k < 11; k++ {
			if table[10][k] == 1 {
				flag = false
				break
			}
		}
		if flag {
			printans(ans)
		}
		return
	}
	if table[i-1][j] == 1 {
		ans[i][j] = 1
		attack(table, i, j)
		if j == 10 {
			solve(table, i+1, 1, ans)
		} else {
			solve(table, i, j+1, ans)
		}
		attack(table, i, j)
		ans[i][j] = 0
	} else {
		ans[i][j] = 0
		if j == 10 {
			solve(table, i+1, 1, ans)
		} else {
			solve(table, i, j+1, ans)
		}
	}
}

func printans(ans [12][12]int) {
	for i := 1; i < 11; i++ {
		for j := 1; j < 11; j++ {
			fmt.Print(ans[i][j])
			if j < 10 {
				fmt.Print(" ")
			}
		}
		fmt.Println()
	}
}

func attack(table [12][12]int, i, j int) {
	table[i][j] = 1 - table[i][j]
	table[i-1][j] = 1 - table[i-1][j]
	table[i+1][j] = 1 - table[i+1][j]
	table[i][j-1] = 1 - table[i][j-1]
	table[i][j+1] = 1 - table[i][j+1]
}

C++: #include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
#include<cstring>
#include<cstdlib>

#define MAX 12
#define INV (-1)

using namespace std;

inline bool inRange(int t, int min, int max){
	return (min <= t && t < max);
}

class CMap{
public:
	int m[MAX][MAX];

	CMap()
	{
		for(int i = 0; i < MAX; ++i)
			for(int j = 0; j < MAX; ++j)
				m[i][j] = 0;
	}

	void Reset(){
		for(int i = 0; i < MAX; ++i)
			for(int j = 0; j < MAX; ++j)
				m[i][j] = 0;
	}

	void PassParticle(int i, int j)
	{
		const int di[] = {0,-1,0,1,0};
		const int dj[] = {0,0,1,0,-1};

		for(int k = 0; k < sizeof(di)/sizeof(*di); ++k)
			if( inRange( i+di[k], 1, MAX - 1 ) && inRange( j + dj[k], 1, MAX - 1 ) )
				m[i+di[k]][j+dj[k]] = (m[i+di[k]][j+dj[k]] + 1) % 2;
	}

	bool NoLight() const
	{
		for(int i = 1; i < MAX - 1; ++i)
			for(int j = 1; j < MAX - 1; ++j)
				if( m[i][j] == 1 ) return false;
		return true;
	}

	void Print() const
	{
		for(int i = 1; i < MAX - 1; ++i){
			cout << m[i][1];
			for(int j = 2; j < MAX - 1; ++j)
				cout << ' ' << m[i][j];
			cout << '\n';
		}
	}
	
	bool operator==(const CMap &t) const
	{
		for(int i = 1; i < MAX - 1; ++i)
			for(int j = 1; j < MAX - 1; ++j)
				if( t.m[i][j] != m[i][j] )
					return false;
		return true;
	}
};

void BFS(CMap &stm, CMap &ret){
	vector< CMap > q;

	q.push_back( stm );

	while( !q.empty() ){
		bool bSCont = true;
		CMap M = q[0];
		
		q.erase( q.begin() );

		if( M.NoLight() )
		{
			ret = M;
			break;
		}

		for(int i = 1; i < MAX - 1 && bSCont; ++i){
			for(int j = 1; j < MAX - 1 && bSCont; ++j){
				if( M.m[i][j] == 1 ){
					CMap add = M;
					int ti = INV, tj = INV;
					const int di[4][5] = {
						{0,-1,-1,-1,0},
						{-1,-1,0,1,1},
						{0,1,1,1,0},
						{1,1,0,-1,-1}
					};
					const int dj[4][5] = {
						{-1,-1,0,1,1,},
						{0,1,1,1,0},
						{1,1,0,-1,-1},
						{0,-1,-1,-1,0}
					};

					for(int k = 0; k < sizeof(di)/sizeof(*di); ++k){
						bool bCont = true;
						for(int l = 0; l < sizeof(*di)/sizeof(**di) && bCont; ++l){
							if( add.m[i+di[k][l]][j+dj[k][l]] != 0 ){
								ti = INV;
								tj = INV;
								bCont = false;
							}else{
								switch( k ){
									case 0: ti = i + 1; tj = j; break;
									case 1: ti = i; tj = j - 1; break;
									case 2: ti = i - 1; tj = j; break;
									case 3: ti = i; tj = j + 1; break;
								}
							}
						}
						if( bCont )
							break;
					}
					if( ti != INV && tj != INV ){
						add.PassParticle( ti, tj );
						q.push_back( add );
					}
				}
			}
		}
	}
}
void DetermineShootingPoints_(CMap &stm, CMap &ans){
	while( !stm.NoLight() ){
		int max1 = 0;
		int pi, pj;

		for(int i = 1; i < MAX - 1; ++i){
			for(int j = 1; j < MAX - 1 ; ++j){
				int cnt1 = 0;
				int cnt_valid = 0;
				const int di[] = {0,-1,0,1,0/*-1,-1,0,1, 1, 1, 0,-1*/};
				const int dj[] = {0,0,1,0,-1/* 0, 1,1,1,-0,-1,-1,-1*/};

				for(int k = 0; k < sizeof(di)/sizeof(*di); ++k){
					if( stm.m[i+di[k]][j+dj[k]] == 1 )
						++cnt1;
					if( inRange( i+di[k], 1, MAX - 1) && inRange( j+dj[k], 1, MAX-1 ) )
						++cnt_valid;
				}

				if( cnt1 == cnt_valid ){
					stm.PassParticle( i, j );
					ans.m[i][j] = 1;
					goto RETRY;
				}

				if( cnt1 > max1 ){
					max1 = cnt1;
					pi = i;
					pj = j;
				}
			}
		}
		stm.PassParticle( pi, pj );
		ans.m[pi][pj] = 1;
RETRY:;
	}
}
void DetermineShootingPoints(CMap &stm, CMap &ans){
	while( !stm.NoLight() ){
		bool bSCont = true;

		for(int i = 1; i < MAX - 1 && bSCont; ++i){
			for(int j = 1; j < MAX - 1 && bSCont; ++j){
				if( stm.m[i][j] == 1 ){
					int ti = INV, tj = INV;
					vector< pair<int, int > > vt;
					const int di[4][5] = {
						{0,-1,-1,-1,0},
						{-1,-1,0,1,1},
						{0,1,1,1,0},
						{1,1,0,-1,-1}
					};
					const int dj[4][5] = {
						{-1,-1,0,1,1,},
						{0,1,1,1,0},
						{1,1,0,-1,-1},
						{0,-1,-1,-1,0}
					};

					for(int k = 0; k < sizeof(di)/sizeof(*di); ++k){
						bool bCont = true;
						for(int l = 0; l < sizeof(*di)/sizeof(**di) && bCont; ++l){
							if( stm.m[i+di[k][l]][j+dj[k][l]] != 0 ){
								ti = INV;
								tj = INV;
								bCont = false;
							}else{
								switch( k ){
									case 0: ti = i + 1; tj = j; break;
									case 1: ti = i; tj = j - 1; break;
									case 2: ti = i - 1; tj = j; break;
									case 3: ti = i; tj = j + 1; break;
								}
							}
						}
						if( bCont ){
							vt.push_back( make_pair( ti, tj ) );
						}
					}
					if( vt.size() > 0 ){
						double maxEfficient = 0.499;
						
						ti = INV; tj = INV;
						for(unsigned int t = 0; t < vt.size(); ++t){
							int cnt1 = 0;
							int invCnt = 0;
							const int di[] = {0,-1,0,1,0};
							const int dj[] = {0,0,1,0,-1};

							for(int k = 0; k < sizeof(di)/sizeof(*di); ++k){
								if( !inRange(vt[t].first+di[k], 1, MAX-1) || !inRange(vt[t].second+dj[k],1,MAX-1) )
									invCnt++;
								if( stm.m[vt[t].first+di[k]][vt[t].second+dj[k]] == 1 )
									cnt1++;
							}

							if( (double)cnt1 / ( 5 - invCnt ) > maxEfficient ){
								maxEfficient = (double)cnt1 / (5 - invCnt);
								ti = vt[t].first; tj = vt[t].second;
							}
						}
						if( ti != INV && tj != INV ){
							stm.PassParticle( ti, tj );
							ans.m[ti][tj] = 1;
							bSCont = false;
						}
					}
				}
			}
		}
	}
}
int main(void){
	int n;

	cin >> n;
	for( int D = 0; D < n; ++D )
	{
		CMap M;
		CMap Answer;

		for(int i = 1; i < MAX - 1; ++i)
			for(int j = 1; j < MAX - 1 ; ++j)
				cin >> M.m[i][j];

		Answer.Reset();
		DetermineShootingPoints( M, Answer );
		Answer.Print();
	}
	return 0;
}