#include "bits/stdc++.h"
#ifdef DEBUG
#include "PrettyDebug.hpp"
#else
#define debug(...) [](auto...){}(__VA_ARGS__)
#define debuga(...) [](auto...){}(__VA_ARGS__)
#endif
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Rev(i,a,b) for(int i=a;i>=b;i--)
#define Fin(file) freopen(file,"r",stdin)
#define Fout(file) freopen(file,"w",stdout)
using namespace std; typedef long long ll; using Map = vector<vector<int>>;
// #define IDEBUG
#ifdef IDEBUG
mt19937 rng(190345);
class Interactor{
    static constexpr int N=505;
    int n,a[N][N];
public:
    int start(){
        // #define MANUAL
        #ifdef MANUAL
        cin>>n; For(i,1,n) { string s; cin>>s; For(j,1,n) a[i][j]=s[j-1]-'0'; }; return n;
        #else
        n=5; For(i,1,n) For(j,1,n) a[i][j]=0;
        if(rng()&1) For(i,1,n) a[i][rng()%n+1]=1; 
        else For(i,1,n) a[rng()%n+1][i]=1;
        return n;
        #endif
    }
    Map query(Map mp){
        cout<<"Query:\n";
        For(i,1,n) { For(j,1,n) cout<<mp[i][j];; cout<<'\n'; }
        Map ans(n+1,vector<int>(n+1,0));
        For(i,1,n) For(j,1,n){
            For(k,1,n) if(mp[i][j]==mp[k][j]&&a[k][j]) ans[i][j]=1;
            For(k,1,n) if(mp[i][j]==mp[i][k]&&a[i][k]) ans[i][j]=1;
        }
        cout<<"Result:\n";
        For(i,1,n) { For(j,1,n) cout<<ans[i][j];; cout<<'\n'; }
        cout<<'\n';
        return ans;
    }
    void answer(Map ans){
        cout<<"Participant Answer:\n";
        For(i,1,n) { For(j,1,n) cout<<ans[i][j];; cout<<'\n'; }
        cout<<"Jury Answer:\n";
        For(i,1,n) { For(j,1,n) cout<<a[i][j];; cout<<'\n'; }
        int tt=0; For(i,1,n) For(j,1,n) if(ans[i][j]) { tt++; if(!a[i][j]) cout<<"Wrong Answer "<<i<<' '<<j<<'\n',exit(0); }
        if(tt<n) cout<<"Wrong Answer: Not enough rooks\n",exit(0);
        else cout<<"Accepted\n";
    }
};
#else
class Interactor{
    int n;
public:
    int start() { cin>>n; return n; }
    Map query(Map mp){
        cout<<"?\n"; For(i,1,n) { For(j,1,n) cout<<mp[i][j];; cout<<'\n'; }
        int result; cin>>result; if(result!=0) exit(0);
        Map res(n+1,vector<int>(n+1)); For(i,1,n) { string s; cin>>s; For(j,1,n) res[i][j]=s[j-1]-'0'; }
        return res;
    }
    void answer(Map ans){
        cout<<"!\n"; For(i,1,n) { For(j,1,n) cout<<ans[i][j];; cout<<'\n'; }
        int result; cin>>result; if(result!=0) exit(0);
    }
};
#endif
Interactor O; int n; Map ans;
void calc(vector<int> A,vector<int> B){
    vector<int> L(n+1),R(n+1),got(n+1); for(int o:A) L[o]=2,R[o]=n;
    while(true){
        int done=1; for(int o:A) if(L[o]==R[o]) ans[o][L[o]]=1; else { done=0; break; }
        if(done) break;
        vector<int> vis(n+1); Map mp(n+1,vector<int>(n+1));
        for(int o:A) if(L[o]!=R[o]){
            mp[o][1]=1; int mid=(L[o]+R[o])>>1; For(i,mid+1,R[o]) vis[i]=1,mp[o][i]=1;
        }
        for(int o:B) if(!vis[o]) got[o]=1,mp[o][o]=1;
        Map res=O.query(mp);
        for(int o:A) if(L[o]!=R[o]){
            int mid=(L[o]+R[o])>>1; if(res[o][1]) L[o]=mid+1; else R[o]=mid;
        }
        for(int o:B) if(!vis[o]) (res[o][o]?ans[o][o]:ans[o][1])=1;
    }
    vector<int> tmp; for(int o:B) if(!got[o]) tmp.push_back(o);
    if(tmp.size()){
        Map mp(n+1,vector<int>(n+1)); for(int o:tmp) mp[o][o]=1;
        Map res=O.query(mp); for(int o:tmp) (res[o][o]?ans[o][o]:ans[o][1])=1;
    }
    O.answer(ans);
}
void work(int qwq){
    debug(qwq);
    vector<int> L(n+1),R(n+1); For(o,1,n) L[o]=1,R[o]=n;
    while(true){
        int done=1; For(o,1,n) if(L[o]==R[o]) ans[L[o]][o]=1; else { done=0; break; }
        if(done) break;
        Map mp(n+1,vector<int>(n+1));
        For(o,1,n) if(L[o]!=R[o]){
            mp[qwq][o]=1; int mid=(L[o]+R[o])>>1; For(i,mid+1,R[o]) mp[i][o]=1;
        }
        Map res=O.query(mp);
        For(o,1,n) if(L[o]!=R[o]){
            int mid=(L[o]+R[o])>>1; if(res[qwq][o]) L[o]=mid+1; else R[o]=mid;
        }
    }
    O.answer(ans);
}
void solve(){
    n=O.start(); Map mp(n+1,vector<int>(n+1)); ans=mp;
    For(i,2,n) mp[i][1]=mp[i][i]=1;
    Map D=O.query(mp); mp=Map(n+1,vector<int>(n+1));
    if(!D[1][1]) return work(1),void();
    int zero=0; For(i,2,n) if(!D[i][i]) { zero=i; break; }
    if(!zero){
        For(i,1,n) mp[i][i]=1;
        Map S=O.query(mp);
        For(i,2,n) if(S[i][i]) ans[i][i]=1; else ans[i][1]=1;
        if(S[1][1]) ans[1][1]=1,O.answer(ans); else calc({1},{});
    }
    else{
        mp[1][1]=1; For(i,2,n) { mp[i][i]=1; if(D[i][i]) mp[i][1]=1; else if(i==zero) mp[1][i]=1; }
        Map S=O.query(mp); For(i,2,n) if(!S[i][1]) return work(i),void();
        vector<int> A,B; if(S[zero][zero]) ans[1][zero]=1; else if(S[1][zero]) ans[1][1]=1; else A.push_back(1);
        For(i,2,n) if(D[i][i]) B.push_back(i); else A.push_back(i);
        calc(A,B);
    }
}
signed main(){
    atexit([](){cerr<<"Time = "<<clock()<<" ms"<<endl;});
    int T; cin>>T; while(T--) solve();
    return 0;
}

// CONTINUE, NON-STOPPING, FOR CHARLIEY
// START TYPING IF YOU DON'T KNOW WHAT TO DO
// STOP TYPING IF YOU DON'T KNOW WHAT YOU'RE DOING

// Started Coding On: February 15 Thu, 16 : 32 : 01