#include<bits/stdc++.h>
#define ll int
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ld long double
using namespace std;

ll b[2000];
bitset <2000> a[2000], ans[2000];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    ll t; cin >> t;
    while (t--)
    {
        string s; cin >> s;
        ll n; cin >> n;
        for (ll i=0; i<n; i++)
            a[i].reset(), ans[i].reset(), b[i]=-1;
        for (ll i=0; i<n; i++) for (ll j=0; j<n; j++)
        {
            char c; cin >> c;
            a[i][j]=c-'0';
        }
        if (s=="good")
        {
            for (ll i=0; i<n; i++)
                for (ll j=0; j<n; j++)
                    if (a[i][j])
                    {
                        if (b[j]!=-1) a[i]^=a[b[j]], ans[i][j]=1;
                        else {b[j]=i; break;}
                    }
            cout << n << "\n";
            for (ll i=0; i<n; i++)
            {
                ans[i]^=a[i];
                for (ll j=0; j<n; j++)
                    cout << ans[i][j];
                cout << "\n";
            }
        }
        else
        {
            for (ll i=0; i<n; i++)
            {
                vector <ll> sus;
                ll first=0;
                for (ll j=0; j<n; j++)
                {
                    if (a[i][j] && b[j]!=-1)
                        sus.pb(j), a[i][j]=0;
                    else if (a[i][j] && !first)
                        first=1, b[j]=i;
                }
                ans[i]^=a[i];
                for (ll j:sus) ans[i]^=a[b[j]];
            }
            cout << n << "\n";
            for (ll i=0; i<n; i++)
            {
                for (ll j=0; j<n; j++)
                    cout << ans[i][j];
                cout << "\n";
            }
        }
    }
}