#include <bits/stdc++.h>
using namespace std;

const bool printXY = false;
const bool printMatch = false;

const int maxn = 2025;

bitset<maxn> A[maxn], B[maxn], X[maxn], Y[maxn], tmpA;
bool hasB[maxn];

void solve() {
    string type;
    cin >> type;
    int n;
    cin >> n;
    // TODO init B, X, Y
    for (int i = 0; i < n; i++) {
        string S;
        cin >> S;
        for (int j = 0; j < n; j++)
            A[i][j] = (S[j] == '1');
    }

    for (int i = 0; i < n; i++)
        B[i].reset();
    for (int i = 0; i < n; i++)
        hasB[i] = false;

    if (type == "good") {
        for (int i = 0; i < n; i++)
            X[i].reset();
        for (int i = 0; i < n; i++)
            Y[i].reset();

        for (int i = 0; i < n; i++) {
            int basis_cnt = 0;
            for (int k = 0; k < n; k++) {
                if (hasB[k]) {
                    if (A[i][k]) {
                        A[i] ^= B[k];
                        X[i][basis_cnt] = true;
                    }
                    ++basis_cnt;
                }
            }
            assert (basis_cnt == i);
            int free_var = 0;
            for (int k = 0; k < n; k++) {
                if (not hasB[k]) {
                    if (A[i][k]) {
                        Y[n - i - 1][free_var] = true;
                    }
                    ++free_var;
                }
            }
            assert (free_var == n - i);

            int lowbit = -1;
            for (int k = 0; k < n; k++) {
                if (A[i][k]) {
                    lowbit = k;
                    break;
                }
            }
            // cerr << "i = " << i << endl;
            // for (int k = 0; k < n; k++)
            //     cerr << A[i][k];
            // cerr << endl;
            assert (lowbit != -1);
            B[lowbit] = A[i];
            hasB[lowbit] = true;
            for (int k = 0; k < n; k++) {
                if (k == lowbit) continue;
                if (hasB[k] && B[k][lowbit])
                    B[k] ^= B[lowbit];
            }
        }

        if (printXY) {
            cerr << "good to X, Y" << endl;
            for (int i = 0; i < n; i++) {
                cerr << "X " << i << " = ";
                for (int j = 0; j < n; j++) {
                    cerr << X[i][j];
                }
                cerr << endl;
            }
            for (int i = 0; i < n; i++) {
                cerr << "Y " << i << " = ";
                for (int j = 0; j < n; j++) {
                    cerr << Y[i][j];
                }
                cerr << endl;
            }
        }

        for (int i = 0; i < n; i++)
            A[i].reset();
        for (int i = 0; i < n; i++)
            B[i].reset();
        for (int i = 0; i < n; i++)
            hasB[i] = false;

        // to lucky
        // TODO
        vector<int> P;

        for (int i = 0; i < n; i++) {
            int invcnt = -1;
            for (int j = i; j >= 0; j--) {
                if (Y[i][j]) {
                    invcnt = j;
                    break;
                }
            }
            if (printMatch) {
                cerr << "#" << __LINE__ << endl;
                cerr << "match, invcnt = " << i << ", " << invcnt << endl;
                // cerr << "i, match, invcnt = " << i << ' ' << match << ' ' << invcnt << endl;
            }

            assert (invcnt != -1);
            P.push_back(-1);
            for (int j = i; j >= invcnt + 1; j--) {
                P[j] = P[j - 1];
            }
            P[invcnt] = i;
            // cerr << "P = ";
            // for (int j = 0; j <= i; j++)
            //     cerr << P[j] << ", ";
            // cerr << endl;
        }

        // cerr << "P = ";
        // for (int j = 0; j < n; j++)
        //     cerr << P[j] << ", ";
        // cerr << endl;

        vector<int> used_col(n);
        for (int i = 0; i < n; i++) {
            A[i][P[i]] = true;
            int match = P[i];
            used_col[match] = true;
            int it = 0;
            // cerr << "@@ i = " << i << endl;
            for (int j = 0; j < match; j++) {
                if (used_col[j]) {
                    if (Y[match][it]) {
                        // cerr << "@@ j = " << j << endl;
                        A[i][j] = true;
                    }
                    ++it;
                }
            }
            for (int j = match + 1; j < n; j++) {
                if (X[n - match - 1][j - (match + 1)]) {
                    A[i][j] = true;
                }
            }
        }
    }

    if (type == "lucky") {
        for (int i = 0; i < n; i++)
            X[i].reset();
        for (int i = 0; i < n; i++)
            Y[i].reset();

        vector<int> used_col(n);
        for (int i = 0; i < n; i++) {
            int match = -1;
            for (int j = 0; j < n; j++) {
                if (A[i][j] && not used_col[j]) {
                    match = j;
                    break;
                }
            }
            assert (match != -1);
            used_col[match] = true;

            int invcnt = 0;
            for (int j = 0; j < match; j++) {
                if (used_col[j]) {
                    invcnt += 1;
                } else
                    assert (not A[i][j]);
            }

            if (printMatch) {
                cerr << "#" << __LINE__ << endl;
                cerr << "i, match, invcnt = " << i << ' ' << match << ' ' << invcnt << endl;
            }

            int it = 0;
            Y[match][invcnt] = true;
            // cerr << "## i = " << i << endl;
            for (int j = 0; j < match; j++) {
                if (used_col[j]) {
                    if (A[i][j]) {
                        // cerr << "## j = " << j << endl;
                        Y[match][it] = true;
                    }
                    // TODO check this
                    ++it;
                }
            }

            for (int j = match + 1; j < n; j++) {
                if (A[i][j]) {
                    // TODO check this
                    X[n - match - 1][j - (match + 1)] = true;
                }
            }
        }

        if (printXY) {
            cerr << "lucky to X, Y" << endl;
            for (int i = 0; i < n; i++) {
                cerr << "X " << i << " = ";
                for (int j = 0; j < n; j++) {
                    cerr << X[i][j];
                }
                cerr << endl;
            }
            for (int i = 0; i < n; i++) {
                cerr << "Y " << i << " = ";
                for (int j = 0; j < n; j++) {
                    cerr << Y[i][j];
                }
                cerr << endl;
            }
        }

        for (int i = 0; i < n; i++)
            A[i].reset();
        for (int i = 0; i < n; i++)
            B[i].reset();
        for (int i = 0; i < n; i++)
            hasB[i] = false;

        for (int i = 0; i < n; i++) {
            int free_var = 0;
            for (int k = 0; k < n; k++) {
                if (not hasB[k]) {
                    if (Y[n - i - 1][free_var]) {
                        A[i][k] = true;
                    }
                    ++free_var;
                }
            }

            tmpA = A[i];
            int basis_cnt = 0;
            for (int k = 0; k < n; k++) {
                if (hasB[k]) {
                    if (X[i][basis_cnt]) {
                        tmpA ^= B[k];
                    }
                    ++basis_cnt;
                }
            }

            int lowbit = -1;
            for (int k = 0; k < n; k++)
                if (A[i][k]) {
                    assert (not hasB[k]);
                    lowbit = k;
                    break;
                }

            assert (lowbit != -1);
            B[lowbit] = A[i];
            hasB[lowbit] = true;
            for (int k = 0; k < n; k++) {
                if (k == lowbit) continue;
                if (hasB[k] && B[k][lowbit])
                    B[k] ^= B[lowbit];
            }

            A[i] = tmpA;
            // cerr << "here A " << i << " = ";
            // for (int j = 0; j < n; j++)
            //     cerr << A[i][j];
            // cerr << endl;
            // cerr << "here X " << i << " = ";
            // for (int j = 0; j < n; j++)
            //     cerr << X[i][j];
            // cerr << endl;

        }
    }

#ifdef CKISEKI
    if (type == "lucky") cout << "good\n";
    if (type == "good") cout << "lucky\n";
#endif

    cout << n << '\n';
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++)
            cout << A[i][j];
        cout << '\n';
    }
}

int main() {
    int T;
#ifdef CKISEKI
    // freopen("g2.in", "r", stdin);
    // cin >> T;
    // while (T--)
    //     solve();
    // freopen("g.in", "r", stdin);
    // cin >> T;
    // while (T--)
    //     solve();
    // return 0;
#endif
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> T;
#ifdef CKISEKI
    cout << T << '\n';
#endif

    while (T--) {
        solve();
    }
}