#include<iostream>
using namespace std;
int a[20][20];
int t,n,i,j,r,c,m=1,p,q;
void fillup(int n,int f,int g)
{
    r = f;
    c = g;
    while(c+1<=n)
            {
                c++;
                a[r][c] = 0;
            }
            c = g;

            while(c-1>=1)
            {
                c--;
                a[r][c] = 0;
            }
            c = g;

            while(r+1<=n)
            {
                r++;
                a[r][c] = 0;
            }
            r = f;

            while(r-1>=1)
            {
                r--;
                a[r][c] = 0;
            }
            r = f;

           while(c+1<=n && r+1<=n)
            {
                c++;
                r++;
                a[r][c] = 0;
            }
            c = g;
            r = f;

            while(c-1>=1 && r-1>=1)
            {
                c--;
                r--;
                a[r][c] = 0;
            }
            c = g;
            r = f;
}
int main()
{
    cin>>t;
    while(t--)
    {
        cin>>n;
        int a[n+1][n+1];
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=n;j++)
                a[i][j] = 1;
        }
        for(j=1;j<=n;j++)
        {
            a[m][j] = 1;
            fillup(n,m,j);

            for(p=1;p<=n;p++)
            {
                for(q=1;q<=n;q++)
                {
                    if(a[p][q]==1)
                    {
                        fillup(n,p,q);
                    }
                }
            }
            for(p=1;p<=n;p++)
           {
            for(q=1;q<=n;q++)
                cout<<a[p][q]<<" ";
            cout<<endl<<endl;
            }
            m++;
            for(p=1;p<=n;p++)
            {
            for(q=1;q<=n;q++)
                a[p][q] = 1;
              }
        }
    }

}