#include <bits/stdc++.h>
using namespace std;
namespace FastIO {
	#define iL (1 << 20)
	char ibuf[iL],*iS = ibuf + iL,*iT = ibuf + iL;
	#define gc() (iS == iT ? (iT = (iS = ibuf) + fread(ibuf,1,iL,stdin),iS == iT ? EOF : *iS++) : *iS++)
	template<typename T>
	inline void read(T &a)
	{
		char ch;int sign = 0;
		for(ch = gc();!isdigit(ch);ch = gc())
			if(ch == '-') sign = 1;
		a = ch & 15;
		for(ch = gc();isdigit(ch);ch = gc())
			a = (a << 3) + (a << 1) + (ch & 15);
		if(sign) a = -a;
	}
	char Out[iL],*iter = Out;
	#define flush() fwrite(Out,1,iter - Out,stdout),iter = Out
	template<typename T>
	inline void write(T x,char end = '\n')
	{
		int c[40],l = 0;if(x < 0) *iter++ = '-',x = -x;
		do c[++l] = x % 10,x /= 10; while(x);
		while(l) *iter++ = c[l--] + '0';
		flush();
	}
	#undef iL 
	#undef gc
	#undef flush
}
using namespace FastIO;
const int N = 1e6 + 5,M = 2.5e7 + 5;
int n,R[N];
int a[N];
int rp[N];
inline void Main() {
	read(n);
	for(int i = 1;i <= n;i++) read(R[i]);
	a[1] = a[2] = 0;
	for(int i = 2;i < n;i++)
		if(R[i] > 0) a[i + 1] = a[i - 1]; else a[i + 1] = a[i - 1] ^ 1; 
	a[0] = 3;a[n + 1] = 4;
	int l = 0,r = 0;
	for(int i = 1;i <= n;i++) {
		if(r >= i) rp[i] = min(r - i + 1,rp[2 * l - i]);
		else rp[i] = 0;
		while(a[i - rp[i]] == a[i + rp[i]]) ++rp[i];
		if(i + rp[i] - 1 > r) r = i + rp[i] - 1,l = i;
	}
	for(int i = 1;i <= n;i++)
		if(rp[i] != R[i] + 1) return puts("0"),void();
	puts("4");
	for(int a = 0;a < 2;++a)
		for(int b = 0;b < 2;++b) {
			for(int i = 1;i <= n;i++) {
				int x = ::a[i] ^ ((i & 1) ? a : b);
				putchar(x + 48);
			}
			putchar('\n');
		}
}
int main() {
	int T;
	read(T);
	while(T--) Main();
	return 0;
}