#include <iostream>
#include <bitset>
using namespace std;
bitset<2005> a[2005], c[2005];
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int t;
    cin >> t;
    for (int jj = 0; jj < t; jj++) {
        string s;
        int n;
        cin >> s >> n;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                char x;
                cin >> x;
                if (x == '1') a[i][j] = 1;
                else a[i][j] = 0;
            }
            c[i].reset();
        }
        if (s == "good") {
            for (int i = 0; i < n; i++) {
                int h = a[i]._Find_first();
                for (int j = i + 1; j < n; j++) {
                    if (a[j][h] == 1) {
                        c[j][h] = 1;
                        a[j] ^= a[i];
                    }
                }
                a[i] ^= c[i];
            }
        }
        else {
            for (int i = 0; i < n; i++) {
                int h = a[i]._Find_first();
                for (int j = i + 1; j < n; j++) {
                    if (a[j][h] == 1) {
                        c[j][h] = 1;
                        a[j][h] = 0;
                    }
                }
            }
            for (int i = n - 1; i >= 0; i--) {
                int h = a[i]._Find_first();
                for (int j = i + 1; j < n; j++) {
                    if (c[j][h] == 1) {
                        a[j] ^= a[i];
                    }
                }
            }
        }
        cout << n << '\n';
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                cout << a[i][j];
            }
            cout << '\n';
        }
    }
}