#include <bits/stdc++.h>
using namespace std;
const int N = 2010;
int n;
inline void Transpose(bitset<N> mp[N]) {
    static bitset<N> tmp[N];
    for (int i = 0; i < n; ++i) tmp[i] = mp[i];
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j)
            mp[i].set(j, tmp[j][i]);
}
bitset<N> mp[N], ans[N];
inline void good2luck() {
    for (int i = 0; i < n; ++i) ans[i].reset();
    vector<int> vis(n), cho(n);
    for (int j = 0; j < n; ++j) {
        for (int i = 0; i < n; ++i) if (!vis[i] && mp[i].test(j)) {
            cho[j] = i;
            vis[i] = 1;
            break;
        }
        for (int i = 0; i < n; ++i) if (mp[i].test(j)) ans[i].set(j);
        for (int nj = j + 1; nj < n; ++nj) ans[cho[j]].set(nj, mp[cho[j]][nj]);
        for (int i = 0; i < n; ++i) if (mp[i].test(j) && cho[j] != i) {
            mp[i] ^= mp[cho[j]];
        }
    }
    Transpose(ans);
}
inline void lucky2good() {
    for (int i = 0; i < n; ++i) ans[i].reset();
    Transpose(mp);
    vector<int> vis(n), cho(n);
    for (int j = 0; j < n; ++j) {
        for (int i = 0; i < n; ++i) if (!vis[i] && mp[i][j]) {
            cho[j] = i;
            vis[i] = 1;
            break;
        }
    }
    for (int j = n - 1; ~j; --j) {
        for (int nj = j; nj < n; ++nj) ans[cho[j]].set(nj, mp[cho[j]][nj]);
        for (int i = 0; i < n; ++i) if (!vis[i] && mp[i][j]) {
            ans[i] ^= ans[cho[j]];
        }
        vis[cho[j]] = 0;
    }
}
int main() {
    int Case;
    scanf("%d", &Case);
    while (Case--) {
        char ty[10];
        scanf("%s", ty);
        scanf("%d", &n);
        // n = rand() % 5 + 1;
        // vector<int> c(n), use(n);
        // for(int i = 0; i < n; i += 1)
        //     c[i] = i;
        // random_shuffle(c.begin(), c.end());
        // for(int i = 0; i < n; i += 1) {
        //     mp[i].reset();
        //     for(int j = 0; j < n; j += 1) {
        //         if(!use[j]) {
        //             if(c[i] != j)
        //                 mp[i].set(j, 0);
        //             else
        //                 mp[i].set(j, 1), use[j] = 1;
        //         }
        //         else
        //             mp[i].set(j, rand() % 2 + 1);
        //     }
        //     ans[i].reset();
        // }
        for (int i = 0; i < n; ++i) {
            mp[i].reset();
            ans[i].reset();
            static char s[N];
            scanf("%s", s);
            for (int j = 0; j < n; ++j) mp[i].set(j, s[j] - '0');
        }
        // static bitset<N> tmp[N];
        // for (int i = 0; i < n; ++i) tmp[i] = mp[i];
        // lucky2good();
        // for (int i = 0; i < n; ++i) mp[i] = ans[i], ans[i].reset();
        // good2luck();
        // for (int i = 0; i < n; ++i) assert(ans[i] == tmp[i]);
        // puts("ok");
        if (*ty == 'g') {
            good2luck();
        } else {
            lucky2good();
        }
        printf("%d\n", n);
        for (int i = 0; i < n; puts(""), ++i) 
            for (int j = 0; j < n; ++j)
                putchar(ans[i].test(j) ? '1' : '0');
    }
    return 0;
}

/*
5
lucky
5
01101
10110
11111
11111
11111

3
good
2
11
10
lucky
2
10
11
good
2
01
10
*/