#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__uint128_t;
const int N=2e3+5,M=N*100+5,K=600+5,mod=998244353,Mod=mod-1;const db eps=1e-6;const int INF=1e9+7;mt19937 rnd(263082);
int n,A[N][N];char s[N],c[N];
bitset<N> B[N];
int vis[N];
void Solve(){
	int i,j;scanf("%s",s+1);scanf("%d",&n);
	for(i=1;i<=n;i++){
		scanf("%s",c+1);
		for(j=1;j<=n;j++) A[i][j]=c[j]-'0';
	}
	if(s[1]=='l'){
		Me(vis,0);
		for(i=1;i<=n;i++){
			for(j=1;j<=n;j++) B[i][j]=A[i][j];
			for(j=1;j<=n;j++) if(vis[j]&&A[i][j]) B[i][j]=0;
			for(j=1;j<=n;j++) if(vis[j]&&A[i][j]) B[i]^=B[vis[j]];
			for(j=1;j<=n;j++) if(A[i][j]&&!vis[j]){vis[j]=i;break;}
		}
		printf("%d\n",n);
		for(i=1;i<=n;printf("\n"),i++) for(j=1;j<=n;j++) printf("%d",(int) B[i][j]);
	}else{
		Me(vis,0);
		for(i=1;i<=n;i++){
			for(j=1;j<=n;j++) B[i][j]=A[i][j];
			for(j=1;j<=n;j++) if(vis[j]&&A[i][j]) B[i]^=B[vis[j]];
			for(j=1;j<=n;j++) if(vis[j]&&A[i][j]) B[i][j]=1;
			for(j=1;j<=n;j++) if(B[i][j]&&!vis[j]){vis[j]=i;break;}
		}
		printf("%d\n",n);
		for(i=1;i<=n;printf("\n"),i++) for(j=1;j<=n;j++) printf("%d",(int) B[i][j]);
	}
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}