#include <bits/stdc++.h>

using namespace std;


#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rep(i, n) for(int i = 0; i < n; i += 1)
#define len(a) ((int)(a).size())


const ll inf = 1e18;
mt19937 rnd(234);


vector<vector<int>> good_to_lucky(vector<vector<int>> a) {
    int n = len(a);
    vector<vector<int>> b(n, vector<int>(n));
    vector<int> usd(n, false);
    vector<int> p(n, -1);
    rep(row, n) {
        rep(col, n) if (usd[col]) b[row][col] = a[row][col];
        for (int i = 0; i < row; i += 1) {
            if (a[row][p[i]]) {
                rep(k, n) a[row][k] ^= a[i][k];
            }
        }
        rep(col, n) if (usd[col]) assert(a[row][col] == 0);
        rep(col, n) if (!usd[col]) b[row][col] = a[row][col];
        rep(col, n) if (!usd[col] and a[row][col]) { p[row] = col; break; }
        assert(p[row] != -1);
        usd[p[row]] = true;
    }
    return b;
}


vector<vector<int>> lucky_to_good(vector<vector<int>> a) {
    int n = len(a);
    vector<vector<int>> b(n, vector<int>(n)), c(n, vector<int>(n));
    vector<int> usd(n, false);
    vector<int> p(n, -1);
    rep(row, n) {
        rep(col, n) if (usd[col]) b[row][col] = a[row][col];
        rep(col, n) if (!usd[col] and a[row][col]) { p[row] = col; break; }
        assert(p[row] != -1);

        rep(col, n) if (!usd[col]) c[row][col] = a[row][col];
        for (int i = 0; i < row; i += 1) {
            if (a[row][p[i]]) {
                rep(k, n) a[row][k] ^= c[i][k];
            }
        }
        rep(col, n) if (usd[col]) assert(a[row][col] == 0);
        rep(col, n) if (!usd[col]) b[row][col] = a[row][col];

        usd[p[row]] = true;
    }
    return b;
}


int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    int t;
    cin >> t;
    rep(itr, t) {
        string type;
        cin >> type;
        int n;
        cin >> n;
        vector<vector<int>> a(n, vector<int>(n));
        rep(i, n) rep(j, n) {
            char x;
            cin >> x;
            a[i][j] = x - '0';
        }
        vector<vector<int>> b;
        if (type == "good") {
            b = good_to_lucky(a);
        } else {
            b = lucky_to_good(a);
        }
        cout << n << "\n";
        rep(i, n) {
            rep(j, n) cout << b[i][j];
            cout << "\n";
        }
    }
    return 0;
}