#include<bits/stdc++.h>
#define endl '\n'
using namespace std;

const int MAXN=205;

int n;
int ans[MAXN][MAXN];

int ptr=1;

int g4[4][4]={0,0,1,1,
              0,2,2,1,
              3,2,-1,4,
              3,3,4,4};

int g5[5][5]={0,1,1,2,2,
              0,0,1,3,2,
              4,4,3,3,5,
              4,6,7,5,5,
              6,6,7,7,-1};

int g7[7][7]={0,0,1,2,2,3,3,
              0,4,1,1,2,5,3,
             -1,4,4,6,5,5,7,
              8,9,9,6,6,7,7,
              8,8,9,10,10,11,11,
              12,13,13,14,10,11,15,
              12,12,13,14,14,15,15};

int g9[9][9]={0, 0, 2, 2, 3, 4, 4, 5, 5,
              0, 1, 2, 3, 3, 4, 6, 5, 7,
              1, 1, 8, 9, 9, 6, 6, 7, 7,
             10, 8, 8,11, 9,12,12,14,14,
             10,10,11,11,13,13,12,15,14,
             17,17,18,21,21,13,15,15,16,
             17,18,18,21,23,23,25,16,16,
             19,20,20,22,23,24,25,25,26,
             19,19,20,22,22,24,24,26,26};

void fill6(int s)
{
    for(int i=1;i<=6*s;i+=3)
    {
        for(int j=1;j<=6*s;j+=2)
        {
            ans[i][j]=ans[i+1][j]=ans[i][j+1]=ptr++;
            ans[i+1][j+1]=ans[i+2][j]=ans[i+2][j+1]=ptr++;
        }
    }
}

void fin1(int n)
{
    for(int j=1;j<n-6;j+=3)
    {
        ans[n-6][j]=ans[n-6][j+1]=ans[n-5][j]=ptr++;
        ans[n-6][j+2]=ans[n-5][j+1]=ans[n-5][j+2]=ptr++;
        ans[n-4][j]=ans[n-4][j+1]=ans[n-3][j]=ptr++;
        ans[n-4][j+2]=ans[n-3][j+1]=ans[n-3][j+2]=ptr++;
    }
    for(int j=1;j<n-6;j+=2)
    {
        ans[n-2][j]=ans[n-2][j+1]=ans[n-1][j]=ptr++;
        ans[n-1][j+1]=ans[n][j]=ans[n][j+1]=ptr++;
    }
    int br=(n-7)*7/3;
    for(int i=1;i<n-6;i++)
    {
        for(int j=n-6;j<=n;j++)
        {
            ans[i][j]=ans[j][i]+br;
        }
    }
    ptr+=br;
    for(int i=n-6;i<=n;i++)
    {
        for(int j=n-6;j<=n;j++)
        {
            ans[i][j]=ptr+g7[i-n+6][j-n+6];
        }
    }
    ptr+=16;
    ans[n-4][n-6]=0;
}

void fin2(int n)
{
    for(int j=1;j<n-1;j+=3)
    {
        ans[n-1][j]=ans[n-1][j+1]=ans[n][j]=ptr++;
        ans[n-1][j+2]=ans[n][j+1]=ans[n][j+2]=ptr++;
    }
    int br=(n-2)*2/3;
    for(int i=1;i<n-1;i++)
    {
        for(int j=n-1;j<=n;j++)
        {
            ans[i][j]=ans[j][i]+br;
        }
    }
    ptr+=br;
    ans[n-1][n-1]=ans[n-1][n]=ans[n][n-1]=ptr++;
}

void fin3(int n)
{
    for(int j=1;j<n-8;j+=2)
    {
        ans[n-8][j]=ans[n-8][j+1]=ans[n-7][j]=ptr++;
        ans[n-7][j+1]=ans[n-6][j]=ans[n-6][j+1]=ptr++;
        ans[n-5][j]=ans[n-5][j+1]=ans[n-4][j]=ptr++;
        ans[n-4][j+1]=ans[n-3][j]=ans[n-3][j+1]=ptr++;
        ans[n-2][j]=ans[n-2][j+1]=ans[n-1][j]=ptr++;
        ans[n-1][j+1]=ans[n][j]=ans[n][j+1]=ptr++;
    }
    int br=(n-9)*9/3;
    for(int i=1;i<n-8;i++)
    {
        for(int j=n-8;j<=n;j++)
        {
            ans[i][j]=ans[j][i]+br;
        }
    }
    ptr+=br;
    for(int i=n-8;i<=n;i++)
    {
        for(int j=n-8;j<=n;j++)
        {
            ans[i][j]=ptr+g9[i-n+8][j-n+8];
        }
    }
    ptr+=27;
}

void fin4(int n)
{
    for(int j=1;j<n-3;j+=3)
    {
        ans[n-3][j]=ans[n-3][j+1]=ans[n-2][j]=ptr++;
        ans[n-3][j+2]=ans[n-2][j+1]=ans[n-2][j+2]=ptr++;
        ans[n-1][j]=ans[n-1][j+1]=ans[n][j]=ptr++;
        ans[n-1][j+2]=ans[n][j+1]=ans[n][j+2]=ptr++;
    }
    int br=(n-4)*4/3;
    for(int i=1;i<n-3;i++)
    {
        for(int j=n-3;j<=n;j++)
        {
            ans[i][j]=ans[j][i]+br;
        }
    }
    ptr+=br;
    for(int i=n-3;i<=n;i++)
    {
        for(int j=n-3;j<=n;j++)
        {
            ans[i][j]=ptr+g4[i-n+3][j-n+3];
        }
    }
    ptr+=5;
    ans[n-1][n-1]=0;
}

void fin5(int n)
{
    for(int j=1;j<n-4;j+=3)
    {
        ans[n-4][j]=ans[n-4][j+1]=ans[n-3][j]=ptr++;
        ans[n-4][j+2]=ans[n-3][j+1]=ans[n-3][j+2]=ptr++;
    }
    for(int j=1;j<n-4;j+=2)
    {
        ans[n-2][j]=ans[n-2][j+1]=ans[n-1][j]=ptr++;
        ans[n-1][j+1]=ans[n][j]=ans[n][j+1]=ptr++;
    }
    int br=(n-5)*5/3;
    for(int i=1;i<n-4;i++)
    {
        for(int j=n-4;j<=n;j++)
        {
            ans[i][j]=ans[j][i]+br;
        }
    }
    ptr+=br;
    for(int i=n-4;i<=n;i++)
    {
        for(int j=n-4;j<=n;j++)
        {
            ans[i][j]=ptr+g5[i-n+4][j-n+4];
        }
    }
    ptr+=8;
    ans[n][n]=0;
}

void solve(int n)
{

    ptr=1;
    if(n==1)
    {
        cout<<0<<endl<<0<<endl;
        return;
    }
    if(n==3)
    {
        cout<<2<<endl;
        cout<<"1 1 0"<<endl<<"1 2 0"<<endl<<"2 2 0"<<endl;
        return;
    }
    memset(ans,0,sizeof(ans));
    int s=n/6;
    if(n%6==1 || n%6==3) s--;
    fill6(s);
    if(n%6==1) fin1(n);
    if(n%6==2) fin2(n);
    if(n%6==3) fin3(n);
    if(n%6==4) fin4(n);
    if(n%6==5) fin5(n);
    cout<<ptr-1<<endl;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            cout<<ans[i][j]<<" ";
        }
        cout<<endl;
    }
}

int main()
{
freopen("figures.in","r",stdin);
freopen("figures.out","w",stdout);

int t;
cin>>t;
while(t--)
{
    cin>>n;
    solve(n);
}
return 0;
}