/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/

#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define pb push_back
#define ff first
#define ss second
#define isz(x) (int)x.size()
using namespace std;

const int mxN = 2e5 + 5;
const int mod = 1e9 + 7;
const i64 oo = 1e18;

void xor_vector(vector<int> &a, const vector<int> &b) {
    assert(isz(a) == isz(b));
    for (int i = 0; i < isz(a); ++i) a[i] ^= b[i];
}

void biject_lucky() {
    int n; cin >> n;
    vector<vector<int>> a(n, vector<int>(n));
    for (auto &v : a) for (int &val : v) {
        char ch; cin >> ch;
        val = (ch - '0');
    }
    cout << n << endl;
    vector<vector<int>> vis(n);
    for (int i = 0; i < n; ++i) {
        int pos = -1;
        for (int j = 0; j < n; ++j) if (vis[j].empty() and a[i][j]) {
            pos = j;
            break;
        }
        vector<int> whoask(n);
        for (int j = pos; j < n; ++j) whoask[j] = a[i][j];
        vis[pos] = whoask;
        for (int j = 0; j < pos; ++j) if (a[i][j]) xor_vector(whoask, vis[j]);
        for (int val : whoask) cout << val;
        cout << "\n";
    }
}

void biject_good() {
    int n; cin >> n;
    vector<vector<int>> a(n, vector<int>(n));
    for (auto &v : a) for (int &val : v) {
        char ch; cin >> ch;
        val = (ch - '0');
    }
    cout << n << endl;
    vector<vector<int>> vis(n);
    for (int i = 0; i < n; ++i) {
        vector<int> whoask = a[i], pos;
        for (int j = 0; j < n; ++j) if (whoask[j]) {
            if (vis[j].empty()) {
                vis[j] = whoask;
                break;
            }
            else {
                pos.emplace_back(j);
                xor_vector(whoask, vis[j]);
            }
        }
        for (int idx : pos) whoask[idx] = 1;
        for (int val : whoask) cout << val;
        cout << "\n";
    }
}

void solve() {
    int n; cin >> n;
    for (int i = 1; i <= n; ++i) {
        string tp; cin >> tp;
        (tp == "lucky" ? biject_lucky() : biject_good());
    }
}

signed main() {

#ifndef CDuongg
    if(fopen(taskname".inp", "r"))
        assert(freopen(taskname".inp", "r", stdin)), assert(freopen(taskname".out", "w", stdout));
#else
    freopen("bai3.inp", "r", stdin);
    freopen("bai3.out", "w", stdout);
    auto start = chrono::high_resolution_clock::now();
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1; //cin >> t;
    while(t--) solve();

#ifdef CDuongg
   auto end = chrono::high_resolution_clock::now();
   cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
   cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
   cout << "Check array size pls sir" << endl;
#endif

}