#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

namespace {

using M = vector<bitset<2000>>;

M from_lucky(const M& a) {
  int n = len(a);
  M b(n);
  bitset<2000> chosen;
  for (int i : rep(n)) {
    int k = 0;
    for (int j : chosen) {
      b[i][k] = a[i][j];
      ++k;
    }
    assert(k == i);
    for (int j : ~chosen) {
      if (n <= j) {
        break;
      }
      b[i][k] = a[i][j];
      ++k;
    }
    assert(k == n);
    chosen[(a[i] & ~chosen)._Find_first()] = 1;
  }
  return b;
}

M to_lucky(const M& b) {
  int n = len(b);
  M a(n);
  bitset<2000> chosen;
  for (int i : rep(n)) {
    int k = 0;
    for (int j : chosen) {
      a[i][j] = b[i][k];
      ++k;
    }
    assert(k == i);
    for (int j : ~chosen) {
      if (n <= j) {
        break;
      }
      a[i][j] = b[i][k];
      ++k;
    }
    assert(k == n);
    chosen[(a[i] & ~chosen)._Find_first()] = 1;
  }
  return a;
}

M from_good(const M& a) {
  int n = len(a);
  M b(n);
  M f = a;
  vector<int> pivot(n, -1);
  bitset<2000> exists;
  for (int i : rep(n)) {
    bitset<2000> bad;
    for (int j : rep(i)) {
      if (f[i][pivot[j]]) {
        f[i] ^= f[j];
        b[i][j] = 1;
      }
    }
    int k = i;
    for (int j : ~exists) {
      if (n <= j) {
        break;
      }
      b[i][k] = f[i][j];
      ++k;
    }
    assert(k == n);
    pivot[i] = f[i]._Find_first();
    exists[pivot[i]] = 1;
  }
  return b;
}

M to_good(const M& b) {
  int n = len(b);
  M a(n);
  M f(n);
  bitset<2000> exists;
  for (int i : rep(n)) {
    int k = i;
    for (int j : ~exists) {
      if (n <= j) {
        break;
      }
      f[i][j] = b[i][k];
      ++k;
    }
    int pivot = f[i]._Find_first();
    exists[pivot] = 1;
    assert(k == n);
    a[i] = f[i];
    for (int j : rep(i)) {
      if (b[i][j]) {
        a[i] ^= f[j];
      }
    }
  }
  return a;
}

void solve() {
  string type;
  scan(type);
  int n;
  scan(n);
  M a(n);
  for (int i : rep(n)) {
    string s;
    scan(s);
    for (int j : rep(n)) {
      a[i][j] = s[j] & 1;
    }
  }

  M b = type == "good" ? from_good(a) : from_lucky(a);
  M ans = type == "good" ? to_lucky(b) : to_good(b);

  print(n);
  for (int i : rep(n)) {
    for (int j : rep(n)) {
      cout << ans[i][j];
    }
    print();
  }
}

}  // namespace

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int t;
  scan(t);
  while (t--) {
    solve();
  }
}

#else  // __INCLUDE_LEVEL__

#include <bits/stdc++.h>

using namespace std;

namespace std {

template <size_t N>
auto begin(const bitset<N>& x) {
  struct {
    const bitset<N>* p;
    size_t i;

    bool operator!=(int) const { return i < p->size(); }
    void operator++() { i = p->_Find_next(i); }
    size_t operator*() const { return i; }
  } ret{&x, x._Find_first()};
  return ret;
}

template <size_t N>
int end(const bitset<N>&) {
  return 0;
}

}  // namespace std

namespace std {

template <class T1, class T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
  return is >> p.first >> p.second;
}

template <class... Ts>
istream& operator>>(istream& is, tuple<Ts...>& t) {
  return apply([&is](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}

template <class R, enable_if_t<!is_convertible_v<R, string>>* = nullptr>
auto operator>>(istream& is, R&& r) -> decltype(is >> *begin(r)) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
  return os << p.first << ' ' << p.second;
}

template <class... Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
  auto f = [&os](const auto&... xs) -> ostream& {
    [[maybe_unused]] auto sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}

template <class R, enable_if_t<!is_convertible_v<R, string_view>>* = nullptr>
auto operator<<(ostream& os, R&& r) -> decltype(os << *begin(r)) {
  auto sep = "";
  for (auto&& e : r) {
    os << exchange(sep, " ") << e;
  }
  return os;
}

}  // namespace std

template <class... Ts>
void scan(Ts&&... xs) {
  (cin >> ... >> xs);
}

template <class... Ts>
void print(Ts&&... xs) {
  cout << tie(xs...) << '\n';
}

inline auto rep(int l, int r) { return views::iota(min(l, r), r); }
inline auto rep(int n) { return rep(0, n); }
inline auto rep1(int l, int r) { return rep(l, r + 1); }
inline auto rep1(int n) { return rep(1, n + 1); }
inline auto per(int l, int r) { return rep(l, r) | views::reverse; }
inline auto per(int n) { return per(0, n); }
inline auto per1(int l, int r) { return per(l, r + 1); }
inline auto per1(int n) { return per(1, n + 1); }

inline auto len = ranges::ssize;

#endif  // __INCLUDE_LEVEL__