#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int T,n;
char type[15],str[2005];

bitset <2005> a[2005],b[2005];
int tag[2005];
void solve(){
	scanf("%s",type + 1);
	scanf("%d",&n);
	rep(i,1,n){
		scanf("%s",str + 1);
		a[i].reset();b[i].reset();
		rep(j,1,n) if(str[j] == '1') a[i].set(j);
	}

	printf("%d\n",n);
	int pos;
	if(type[1] == 'g'){
		rep(i,1,n){
			pos = a[i]._Find_first();
			rep(j,i + 1,n){
				if(a[j].test(pos)){
					a[j] ^= a[i];
					b[j].set(i);
				}
			}
		}
		rep(i,1,n){
			rep(j,1,n) printf("%d",a[i].test(j) | b[i].test(j));
			printf("\n");
		}
		return;
	}

	fill(tag,tag + n + 1,0);
	rep(i,1,n){
		pos = n + 1;
		rep(j,1,n){
			if(!tag[j] && a[i].test(j)){
				chkmin(pos,j);
				b[i].set(j);a[i].reset(j);
			}
		}
		tag[pos] = i;
	}
	per(i,n,1){
		rep(j,1,n) if(a[i].test(j)) b[i] ^= b[tag[j]];
	}
	rep(i,1,n){
		rep(j,1,n) printf("%d",b[i].test(j));
		printf("\n");
	}
}

int main(){
//	freopen("test.in","r",stdin);
	scanf("%d",&T);
	while(T--) solve();
	return 0;
}