#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) ((int)((x).size()))
#define int ll
// #define N 
using namespace std;
const int N=3005;
const int f5[5][5]={
{1,1,0,2,2},
{1,3,3,4,2},
{3,1,3,2,4},
{5,0,5,4,4},
{5,5,0,0,0}};
const int f4[4][4]={
{1,1,2,2},
{1,2,3,2},
{4,1,4,3},
{4,4,3,3}};
const int L1[4][4]={
{1,1,0},
{1,2,2},
{2,1,2}};
const int L2[4][4]={
{2,1,1},
{1,2,1},
{2,2,0}};
const int L3[4][4]={
{2,1,2},
{2,2,1},
{0,1,1}};
const int L4[4][4]={
{0,2,2},
{1,2,1},
{1,1,2}};
const int S1[4][4]={
{1,1,0,0},
{1,2,1,2},
{0,0,2,2},
{0,0,0,0}};
const int S2[4][4]={
{0,1,1,0},
{0,2,1,0},
{2,1,0,0},
{2,2,0,0}};
const int M1[4][4]={
{1,1,0,0},
{1,2,0,0},
{2,1,0,0},
{2,2,0,0}};
const int M2[4][4]={
{1,1,2,2},
{1,2,1,2},
{0,0,0,0},
{0,0,0,0}};
int n,ans[N][N];
int t=0;
void pt(int x,int y,const int pp[4][4])
{
        {
            int i=x,j=y;
                for (int x=0;x<4;x++)
                    for (int y=0;y<4;y++)
                    {
                        if (pp[x][y])
                        {
                            ans[i+x][j+y]=t+pp[x][y];
                        }
                    }
            t+=2;
        }
}
void calc(int x,int y,int n)
{
    if (n==5)
    {
        for (int i=0;i<5;i++)
            for (int j=0;j<5;j++)
                ans[i+x][j+y]=t+f5[i][j];
        t+=5;
        return;
    }
    if (n==9)
    {
        int i=x,j=y;
        pt(i+0,j+0,M1);
        pt(i+0,j+2,M2);
        pt(i+0,j+6,L3);
        pt(i+2,j+2,L1);
        pt(i+2,j+5,S1);
        pt(i+4,j+0,S1);
        pt(i+4,j+4,L4);
        pt(i+5,j+7,M1);
        pt(i+6,j+0,L1);
        pt(i+7,j+3,M2);
        return;
    }
    calc(x+2,y+4,n-4);
    pt(x+n-3,y+2,L1);
    pt(x,y+2,S2);
    pt(x,y,L2);
    pt(x+3,y,S1);
    {
        int j=0;
        for (int i=x+5;i+3<x+n;i+=4)
            pt(i,y+j,M1);
    }
    {
        int j=2;
        for (int i=x+6;i+3<x+n-3;i+=4)
            pt(i,y+j,M1);
    }
    {
        for (int i=5;i+3<n;i+=4)
            pt(x+0,y+i,M2);
    }
    {
        for (int i=5;i+3<n;i+=4)
            pt(x+n-2,y+i,M2);
    }
}
void BellaKira()
{
    cin>>n;
    for (int i=0;i<n;i++)
        for (int j=0;j<n;j++) ans[i][j]=0;
    t=0;
    if (n<=2)
    {
        cout<<0<<'\n';
        for (int i=0;i<n;i++)
        {
            for (int j=0;j<n;j++)
            {
                cout<<0;
                if (j+1<n) cout<<" ";
            }
            cout<<'\n';
        }
        return;
    }
    if (n==3)
    {
        cout<<2<<'\n';
        for (int i=0;i<n;i++)
        {
            for (int j=0;j<n;j++)
            {
                cout<<L1[i][j];
                if (j+1<n) cout<<" ";
            }
            cout<<'\n';
        }
        return;
    }
    if (n%4==0)
    {
        for (int i=0;i<n;i+=2)
        {
            for (int j=0;j<n;j+=4)
            {
                for (int x=0;x<4;x++)
                    for (int y=0;y<4;y++)
                    {
                        if (M2[x][y])
                            ans[i+x][j+y]=t+M2[x][y];
                    }
                t+=2;
            }
        }
        cout<<t<<'\n';
        for (int i=0;i<n;i++)
        {
            for (int j=0;j<n;j++)
            {
                cout<<ans[i][j];
                if (j+1<n) cout<<" ";
            }
            cout<<'\n';
        }
        return;
    }
    if (n%4==2)
    {
        for (int i=0;i<n;i+=2)
        {
            for (int j=0;j+3<n;j+=4)
            {
                for (int x=0;x<4;x++)
                    for (int y=0;y<4;y++)
                    {
                        if (M2[x][y])
                            ans[i+x][j+y]=t+M2[x][y];
                    }
                t+=2;
            }
        }
        for (int i=0;i+3<n;i+=4)
        {
            for (int j=n-2;j<n;j+=2)
            {
                for (int x=0;x<4;x++)
                    for (int y=0;y<4;y++)
                    {
                        if (M1[x][y])
                            ans[i+x][j+y]=t+M1[x][y];
                    }
                t+=2;
            }
        }
        cout<<t<<'\n';
        for (int i=0;i<n;i++)
        {
            for (int j=0;j<n;j++)
            {
                cout<<ans[i][j];
                if (j+1<n) cout<<" ";
            }
            cout<<'\n';
        }
        return;
    }
    if (n%4==1)
    {
        calc(0,0,n);
        cout<<t<<'\n';
        for (int i=0;i<n;i++)
        {
            for (int j=0;j<n;j++)
            {
                cout<<ans[i][j];
                if (j+1<n) cout<<" ";
            }
            cout<<'\n';
        }
        return;
    }
    if (n%4==3)
    {
        calc(2,2,n-2);
        for (int i=0;i<=0;i+=2)
        {
            for (int j=3;j+3<n;j+=4)
            {
                pt(i,j,M2);
            }
        }
        for (int i=3;i+3<n;i+=4)
        {
            for (int j=0;j<=0;j+=2)
            {
                pt(i,j,M1);
            }
        }
        pt(0,0,L2);
        cout<<t<<'\n';
        for (int i=0;i<n;i++)
        {
            for (int j=0;j<n;j++)
            {
                cout<<ans[i][j];
                if (j+1<n) cout<<" ";
            }
            cout<<'\n';
        }
        return;
    }

}
signed main()
{
    IOS;
    cin.tie(0);
    int T=1;
    cin>>T;
    // cout<<setw(3);

    while (T--)
    {
        BellaKira();
    }
}
/*list:
1.mod 998244353 or 1e9+7 or ???
2.N
3.duipai shuju xingtai duoyidian
...
*/