#include <bits/stdc++.h>
#define FileIO_(file) \
    freopen (file ".in", "r", stdin); \
    freopen (file ".out", "w", stdout);

using namespace std;

template<typename Tp>
inline void chmin (Tp &x, const Tp &y) { if (y < x) x = y; }
template<typename Tp>
inline void chmax (Tp &x, const Tp &y) { if (x < y) x = y; }

typedef double dbl;
typedef long long ll;
typedef long double ldb;

void init () {}

typedef vector<int> vint;
typedef vector<vint> vvint;
const int maxn = 5e2 + 20;
int n, obj[maxn][maxn], ans[maxn][maxn];

void clear (int arr[maxn][maxn]) {
    for (int i = 0; i < n; ++i)
        memset (arr[i], 0, sizeof (int) * n);
}

void ask (bool ok = 0) {
    puts (ok ? "!" : "?");

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j)
            putchar ((ok ? ans : obj)[i][j] | 48);
        putchar (10);
    }

    fflush (stdout);

    static int code;
    while (!isdigit (code = getchar ()));

    assert (~code & 1);

    if (ok) return;

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            while (!isdigit (obj[i][j] = getchar ()));
            obj[i][j] &= 15;
        }
    }
}

int lo[maxn], hi[maxn];

void chrow (int rid) {
    bool ok = 0;

    fill (lo, lo + n, 0);
    fill (hi, hi + n, n - 1);

    while (!ok) {
        clear (obj);

        for (int i = 0; i < n; ++i) {
            int &l = lo[i], &r = hi[i];
            const int mid = (l + r) >> 1;
            for (int j = l; j <= mid; ++j)
                obj[j][i] = 1;
            obj[rid][i] = 1;
        }

        ask (); ok = 1;

        for (int i = 0; i < n; ++i) {
            int &l = lo[i], &r = hi[i];
            const int mid = (l + r) >> 1;
            if (obj[rid][i]) r = mid;
            else l = mid + 1;
            ok &= l == r;
        }
    }

    for (int i = 0; i < n; ++i)
        ans[lo[i]][i] = 1;

    ask (ok);
}

void solve () {
    scanf ("%d", &n);

    clear (obj); clear (ans);

    for (int i = 1; i < n; ++i)
        obj[i][0] = obj[i][i] = 1;
    
    ask ();

    if (!obj[0][0]) return chrow (0);

    list<int> lst[2];

    for (int i = 1; i < n; ++i)
        lst[obj[i][i]].emplace_back (i);
    
    clear (obj);

    if (lst[0].empty ()) {
        for (int i = 1; i < n; ++i)
            obj[i][i] = 1;
        
        ask ();

        for (int i = 1; i < n; ++i)
            ans[i][obj[i][i] ? i : 0] = 1;
        
        int l = 0, r = n - 1, mid;

        while (l < r) {
            mid = (l + r) >> 1; clear (obj);

            for (int i = 0; i < n; ++i)
                obj[0][i] = l <= i && i <= mid;
            
            ask ();

            if (obj[0][l]) r = mid;
            else l = mid + 1;
        }

        ans[0][l] = 1;
        
        return ask (true);
    }

    int pos = lst[0].front ();

    obj[0][0] = obj[0][pos] = obj[pos][pos] = 1;
    for (int rid : lst[1]) obj[rid][0] = 1;

    ask ();

    for (int rid : lst[0])
        if (!obj[rid][0])
            return chrow (rid);
    
    if (obj[pos][pos]) {
        ans[0][pos] = 1;
    } else if (obj[0][pos]) {
        ans[0][0] = 1;
    } else lst[0].emplace_front (0);

    vector<int> vpos; vpos.reserve (n);

    if (lst[0].front ())
        vpos.emplace_back (0);

    for (int rid : lst[0])
        vpos.emplace_back (rid);
    
    int s = vpos.size ();

    for (int rid : lst[1])
        vpos.emplace_back (rid);
    
    vector<int> flag (n);

    bool ok = 0;

    fill (lo, lo + n, 0);
    fill (hi, hi + n, n - 1);

    while (!ok) {
        clear (obj);
        fill (flag.begin (), flag.end (), 0);

        for (int i : lst[0]) {
            int &l = lo[i], &r = hi[i];
            const int mid = (l + r) >> 1;
            for (int j = l; j <= mid; ++j)
                flag[j] = obj[i][vpos[j]] = 1;
            obj[i][0] = 1;
        }

        for (int i = s; i < n; ++i)
            if (!flag[i]) obj[vpos[i]][vpos[i]] = 1;
        
        ask (); ok = 1;

        for (int i : lst[0]) {
            int &l = lo[i], &r = hi[i];
            const int mid = (l + r) >> 1;
            if (obj[i][0]) r = mid;
            else l = mid + 1;
            ok &= l == r;
        }

        for (int i = s; i < n; ++i)
            if (!flag[i]) ans[vpos[i]][
                obj[vpos[i]][vpos[i]] ?
                vpos[i] : 0
            ] = 1;
    }

    for (int i : lst[0])
        ans[i][vpos[lo[i]]] = 1;

    ask (ok);
}

int main () {
//	#ifndef LSY
//	FileIO_("");
//	#endif
    int t = 1; init ();
	scanf ("%d", &t);
    while (t--) solve ();
    return 0;
}