#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
#define fl fflush(stdout)
ll t,n,L[550],R[550];
bl ck[550][550],c1[550][550],c2[550][550],ans[550][550];
bl nd[550],vis[550],ban[550];
char s[550];
il void query(){
	pf("?\n");
	fr(i,1,n){
		fr(j,1,n) write(ck[i][j]);
		enter;
	}
	fl;
	ll tmp=read();
	fr(i,1,n){
		scanf("%s",s+1);
		fr(j,1,n) ck[i][j]=s[j]-'0';
	}
}
il void clr(){
	fr(i,1,n) nd[i]=vis[i]=ban[i]=0;
	fr(i,1,n) fr(j,1,n) ck[i][j]=c1[i][j]=c2[i][j]=ans[i][j]=0;
}
il void report(){
	pf("!\n");
	fr(i,1,n){
		fr(j,1,n) write(ans[i][j]);
		enter;
	}
	fl;
	ll tmp=read();
	clr();
}
il void solve1(ll x){
	fr(i,1,n){
		L[i]=1;
		R[i]=n;
	}
	while(1){
		bl pd=0;
		fr(i,1,n) fr(j,1,n) ck[i][j]=0;
		fr(i,1,n){
			if(L[i]<R[i]){
				pd=1;
				ll mid=(L[i]+R[i])/2;
				fr(j,L[i],mid) ck[j][i]=1;
			}
		}
		if(!pd) break;
		fr(i,1,n) ck[x][i]=1;
		query();
		fr(i,1,n){
			if(L[i]<R[i]){
				ll mid=(L[i]+R[i])/2;
				if(ck[x][i]) R[i]=mid;
				else L[i]=mid+1;
			}
		}
	}
	fr(i,1,n) ans[L[i]][i]=1;
	report();
}
il void solve2(){
	fr(i,1,n) fr(j,1,n) ck[i][j]=0;
	fr(i,2,n) ck[i][i]=1;
	query();
	fr(i,2,n){
		if(ck[i][i]) ans[i][i]=1;
		else ans[i][1]=1;
	}
	ll l=1,r=n;
	while(l<r){
		ll mid=(l+r)>>1;
		fr(i,1,n) fr(j,1,n) ck[i][j]=0;
		fr(i,1,mid) ck[1][i]=1;
		query();
		if(ck[1][1]) r=mid;
		else l=mid+1;
	}
	ans[1][l]=1;
	report();
}
il void solve3(){
	fr(i,1,n){
		L[i]=1;
		R[i]=n;
	}
	while(1){
		bl pd=0;
		fr(i,1,n) fr(j,1,n) ck[i][j]=0;
		fr(i,1,n) ban[i]=0;
		fr(i,1,n){
			if(!nd[i]||L[i]>=R[i]) continue;
			pd=1;
			ll mid=(L[i]+R[i])/2;
			fr(j,L[i],mid) ck[i][j]=ban[j]=1;
			ck[i][1]=1;
		}
		fr(i,1,n) if(!nd[i]&&!vis[i]&&!ban[i]) ck[i][i]=pd=1;
		if(!pd) break;
		query();
		fr(i,1,n){
			if(!nd[i]||L[i]>=R[i]) continue;
			ll mid=(L[i]+R[i])/2;
			if(ck[i][1]) R[i]=mid;
			else L[i]=mid+1;
		}
		fr(i,1,n){
			if(!nd[i]&&!vis[i]&&!ban[i]){
				if(ck[i][i]) ans[i][i]=1;
				else ans[i][1]=1;
				vis[i]=1;
			}
		}
	}
	fr(i,1,n) if(nd[i]) ans[i][L[i]]=1;
	report();
}
int main(){
	t=read();
	while(t--){
		n=read();
		fr(i,1,n) fr(j,1,n) ck[i][j]=0;
		fr(i,2,n) ck[i][1]=ck[i][i]=1;
		query();
		fr(i,1,n) fr(j,1,n) c1[i][j]=ck[i][j];
		if(!c1[1][1]){
			solve1(1);
			continue;
		}
		bl pd=0;
		fr(i,1,n) if(!c1[i][i]) pd=1;
		if(!pd){
			solve2();
			continue;
		}
		fr(i,1,n) fr(j,1,n) ck[i][j]=0;
		ck[1][1]=1;
		fr(i,2,n){
			if(!c1[i][i]) ck[i][i]=ck[1][i]=1;
			else ck[i][1]=1;
		}
		query();
		fr(i,1,n) fr(j,1,n) c2[i][j]=ck[i][j];
		pd=0;
		fr(i,2,n){
			if(!c1[i][i]&&!c2[i][1]){
				solve1(i);
				pd=1;
				break;
			}
		}
		if(pd) continue;
		fr(i,2,n) if(!c1[i][i]&&c2[i][i]) ans[1][i]=pd=1;
		if(!pd){
			fr(i,2,n) if(!c1[i][i]&&c2[1][i]) ans[1][1]=1;
		}
		pd=0;
		fr(i,1,n) if(ans[1][i]) pd=1;
		if(!pd) nd[1]=1;
		else vis[1]=1;
		fr(i,2,n) if(!c1[i][i]) nd[i]=1;
		solve3();
	}
}
/*
2
5
10110
00100
01000
00000
00001
5
01000
00010
01000
10000
10010
*/