#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


// #define DEBUG

int N;
#ifdef DEBUG
vector<vector<int>> secret;
#endif

void input() {
#ifdef DEBUG
#else
  scanf("%d", &N);
#endif
}

void waAsk() {
cerr<<"[waAsk]"<<endl;
  exit(0);
}
void waAnswer() {
cerr<<"[waAnswer]"<<endl;
  exit(0);
}

char buf[510];
vector<vector<int>> ask(const vector<vector<int>> &a) {
  vector<vector<int>> b(N, vector<int>(N, 0));
#ifdef DEBUG
  for (int x = 0; x < N; ++x) {
    for (int y = 0; y < N; ++y) {
      for (int xx = 0; xx < N; ++xx) if (a[x][y] == a[xx][y] && secret[xx][y]) b[x][y] = 1;
      for (int yy = 0; yy < N; ++yy) if (a[x][y] == a[x][yy] && secret[x][yy]) b[x][y] = 1;
    }
  }
  /*
  cerr << "a = " << endl;
  for (int x = 0; x < N; ++x) {
    for (int y = 0; y < N; ++y) cerr << a[x][y];
    cerr << endl;
  }
  cerr << "b = " << endl;
  for (int x = 0; x < N; ++x) {
    for (int y = 0; y < N; ++y) cerr << b[x][y];
    cerr << endl;
  }
  */
#else
  puts("?");
  for (int x = 0; x < N; ++x) {
    for (int y = 0; y < N; ++y) printf("%d", a[x][y]);
    puts("");
  }
  fflush(stdout);
  int code;
  scanf("%d", &code);
  if (code) waAsk();
  for (int x = 0; x < N; ++x) {
    scanf("%s", buf);
    for (int y = 0; y < N; ++y) b[x][y] = buf[y] - '0';
  }
#endif
  return b;
}
void answer(const vector<vector<int>> &ans) {
#ifdef DEBUG
  bool ac = true;
  int cnt = 0;
  for (int x = 0; x < N; ++x) for (int y = 0; y < N; ++y) if (ans[x][y]) {
    ac = ac && secret[x][y];
    ++cnt;
  }
  ac = ac && (cnt >= N);
  if (!ac) {
    cerr << "secret = " << endl;
    for (int x = 0; x < N; ++x) {
      for (int y = 0; y < N; ++y) cerr << (secret[x][y] ? 'R' : 'x');
      cerr << endl;
    }
    cerr << "ans = " << endl;
    for (int x = 0; x < N; ++x) {
      for (int y = 0; y < N; ++y) cerr << (ans[x][y] ? 'R' : '.');
      cerr << endl;
    }
  }
  assert(ac);
#else
  puts("!");
  for (int x = 0; x < N; ++x) {
    for (int y = 0; y < N; ++y) printf("%d", ans[x][y]);
    puts("");
  }
  fflush(stdout);
  int code;
  scanf("%d", &code);
  if (code) waAnswer();
#endif
}

// row x0 is empty ==> every column has rook
void emptyRow(int x0) {
// cerr<<COLOR("91")<<"[emptyRow] x0 = "<<x0<<COLOR()<<endl;
  // binary search columns [0, N)
  vector<int> los(N, 0), his(N, N);
  for (; ; ) {
    bool any = false;
    vector<vector<int>> a(N, vector<int>(N, 0));
    for (int y = 0; y < N; ++y) if (los[y] + 1 < his[y]) {
      any = true;
      const int mid = (los[y] + his[y]) / 2;
      a[x0][y] = 1;
      for (int x = los[y]; x < mid; ++x) a[x][y] = 1;
    }
    if (!any) break;
    const auto b = ask(a);
    for (int y = 0; y < N; ++y) if (los[y] + 1 < his[y]) {
      const int mid = (los[y] + his[y]) / 2;
      (b[x0][y] ? his[y] : los[y]) = mid;
    }
  }
  vector<vector<int>> ans(N, vector<int>(N, 0));
  for (int y = 0; y < N; ++y) ans[los[y]][y] = 1;
  answer(ans);
}

void solve() {
  input();
  /*
    00000
    11000
    10100
    10010
    10001
  */
  vector<vector<int>> a0(N, vector<int>(N, 0));
  for (int x = 1; x < N; ++x) a0[x][0] = a0[x][x] = 1;
  const auto b0 = ask(a0);
  if (b0[0][0]) {
    // row 0 has rook
    vector<int> xs{0};
    int l = xs.size();
    for (int x = 1; x < N; ++x) if (!b0[x][x]) {
      // (x, 0) and (x, x) are empty
      xs.push_back(x);
    }
    const int r = xs.size();
    for (int x = 1; x < N; ++x) if (b0[x][x]) {
      // (x, 0) or (x, x) has rook
      xs.push_back(x);
    }
// cerr<<"l = "<<l<<", r = "<<r<<", xs = "<<xs<<endl;
    if (l < r) {
      /*
        11000
        01000
        00000
        10000
        10000
      */
      vector<vector<int>> a1(N, vector<int>(N, 0));
      a1[0][0] = a1[0][xs[1]] = a1[xs[1]][xs[1]] = 1;
      for (int i = r; i < N; ++i) a1[xs[i]][0] = 1;
      const auto b1 = ask(a1);
      for (int i = l; i < r; ++i) if (!b1[xs[i]][0]) {
        // row xs[i] is empty
        emptyRow(xs[i]);
        return;
      }
      // every row has rook
      vector<vector<int>> ans(N, vector<int>(N, 0));
      if (b1[xs[1]][xs[1]]) {
// cerr<<COLOR("91")<<"Case. "<<__LINE__<<COLOR()<<endl;
        /*
          .R...
          xx...
          x.x..
          ?..?.
          ?...?
        */
        ans[0][xs[1]] = 1;
      } else if (b1[0][xs[1]]) {
// cerr<<COLOR("91")<<"Case. "<<__LINE__<<COLOR()<<endl;
        /*
          Rx...
          xx...
          x.x..
          ?..?.
          ?...?
        */
        ans[0][0] = 1;
      } else {
// cerr<<COLOR("91")<<"Case. "<<__LINE__<<COLOR()<<endl;
        /*
          xx...
          xx...
          x.x..
          ?..?.
          ?...?
        */
        --l;
      }
      // binary search rows xs[l, r)
      vector<int> los(N, 0), his(N, N);
      for (; ; ) {
        bool any = false;
        vector<int> used(N, 0);
        vector<vector<int>> a(N, vector<int>(N, 0));
        for (int i = l; i < r; ++i) if (los[i] + 1 < his[i]) {
          any = true;
          const int mid = (los[i] + his[i]) / 2;
          a[xs[i]][0] = 1;
          for (int j = los[i]; j < mid; ++j) used[j] = a[xs[i]][xs[j]] = 1;
        }
        if (!any) break;
        // tsuide ni 2taku rows[r, N)
        for (int i = r; i < N; ++i) if (!used[i]) a[xs[i]][xs[i]] = 1;
        const auto b = ask(a);
        for (int i = l; i < r; ++i) if (los[i] + 1 < his[i]) {
          const int mid = (los[i] + his[i]) / 2;
          (b[xs[i]][0] ? his[i] : los[i]) = mid;
        }
        for (int i = r; i < N; ++i) if (!used[i]) ans[xs[i]][b[xs[i]][xs[i]] ? xs[i] : 0] = 1;
      }
      for (int i = l; i < r; ++i) ans[xs[i]][xs[los[i]]] = 1;
      answer(ans);
    } else {
      /*
        .....
        ??...
        ?.?..
        ?..?.
        ?...?
      */
      vector<vector<int>> a1(N, vector<int>(N, 0));
      for (int x = 1; x < N; ++x) a1[x][x] = 1;
      const auto b1 = ask(a1);
      vector<vector<int>> ans(N, vector<int>(N, 0));
      for (int x = 1; x < N; ++x) ans[x][b1[x][x] ? x : 0] = 1;
      // binary search only row 0
      int lo = 0, hi = N;
      for (; lo + 1 < hi; ) {
        const int mid = (lo + hi) / 2;
        vector<vector<int>> a(N, vector<int>(N, 0));
        for (int y = lo; y < mid; ++y) a[0][y] = 1;
        const auto b = ask(a);
        (b[0][lo] ? hi : lo) = mid;
      }
      ans[0][lo] = 1;
      answer(ans);
    }
  } else {
    // row 0 is empty
    emptyRow(0);
  }
}

#ifdef DEBUG
void stress() {
  for (N = 3; N <= 5; ++N) {
    for (int p = 0; p < 1 << (N * N); ++p) {
      secret.assign(N, vector<int>(N, 0));
      vector<int> row(N, 0), col(N, 0);
      for (int x = 0; x < N; ++x) for (int y = 0; y < N; ++y) {
        secret[x][y] = p >> (x * N + y) & 1;
        row[x] += secret[x][y];
        col[y] += secret[x][y];
      }
      bool valid = false;
      {
        bool ok = true;
        for (int x = 0; x < N; ++x) ok = ok && row[x];
        valid = valid || ok;
      }
      {
        bool ok = true;
        for (int y = 0; y < N; ++y) ok = ok && col[y];
        valid = valid || ok;
      }
      if (valid) {
        solve();
      }
    }
    cerr << "DONE N = " << N << endl;
  }
}
#endif

int main() {
#ifdef DEBUG
  stress();
#else
  int T;
  scanf("%d", &T);
  for (; T--; ) {
    solve();
  }
#endif
  return 0;
}