#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
vector<int> manacher_odd(string s) {
    int n = s.size();
    s = "$" + s + "^";
    vector<int> p(n + 2);
    int l = 1, r = 1;
    for(int i = 1; i <= n; i++) {
        p[i] = max(0, min(r - i, p[l + (r - i)]));
        while(s[i - p[i]] == s[i + p[i]]) {
            p[i]++;
        }
        if(i + p[i] > r) {
            l = i - p[i], r = i + p[i];
        }
    }
    return vector<int>(begin(p) + 1, end(p) - 1);
}
void solve() {
	int n;
	cin >> n;
	vector<int>V(n), ans(n);
	rep(i, n) cin >> V[i];
	for(int i=1; i<n-1; ++i) 
		if(V[i]) ans[i+1]=ans[i-1]; else ans[i+1]=ans[i-1]^1;
	string s="";
	rep(i, n) if(ans[i]) s+="1"; else s+="0";
	vector<int>P=manacher_odd(s);
	rep(i, n) if(V[i]!=P[i]-1) {
		cout << 0 << '\n';
		return;
	}
	cout << 4 << '\n';
	rep(a, 2) rep(b, 2) {
		s="";
		rep(i, n) {
			int x=ans[i];
			if(i%2==0) x^=a; else x^=b;
			if(x) s+="1"; else s+="0";
		}
		cout << s << '\n';
	}
}
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int _=1;
	cin >> _;
	while(_--) solve();
}