#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define pll pair <ll,ll>
#define fi first
#define se second
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1LL)
#define MASK(i) (1LL << (i))
#define MP make_pair
#define ms(a) memset(a,0,sizeof (a))
#define bs bitset <2024>
int main(){
    ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
    ll t;
    cin>>t;
    while (t--){
        string type;
        cin>>type;
        ll n;
        cin>>n;
        vector <bs> a(n);
        vector <bs> basis(n),res(n);
        for (ll i=  0;i < n;i ++){
            string s;
            cin>>s;
            for (ll j = 0;j < n;j ++){
                a[i][j]=s[j]-'0';
            }
        }
        if (type=="good"){
            for (ll i = 0;i < n;i ++){
                basis[i] = a[i];
                for (ll j = 0;j < i;j ++){
                    if (basis[i][basis[j]._Find_first()]==1){
                        basis[i] ^= basis[j];
                        res[i][j] = 1;
                    }
                }
                res[i] ^= basis[i];
            }
            cout<<n<<'\n';
            for (ll i = 0;i < n; i++){
                for (ll j = 0;j < n;j ++){
                    cout<<res[i][j];
                }
                cout<<'\n';
            }
        }
        else{
            for (ll i = 0;i < n;i ++){
                basis[i] = a[i];
                for (ll j = i-1;j >= 0;j--){
                    if (a[i][basis[j]._Find_first()]==1){
                        a[i][basis[j]._Find_first()]=0;
                        a[i] ^= basis[j];
                        basis[i][j] = 0;
                    }
                }
                res[i] = a[i];
            }
            cout<<n<<'\n';
            for (ll i = 0;i < n; i++){
                for (ll j = 0;j < n;j ++){
                    cout<<res[i][j];
                }
                cout<<'\n';
            }
        }
    }
    return 0;
}