#include <bits/stdc++.h>
#define il inline
using namespace std;
const int N=2005;
int a[N][N],cnt;
il void init(int dx,int dy,int x,int y,int t){
    int u=dx+x,v=dy+y;
    if(t==1) a[u-1][v-1]=a[u-1][v]=a[u][v-1]=a[u][v+1]=++cnt;
    if(t==2) a[u-1][v-1]=a[u-1][v]=a[u][v-1]=a[u+1][v]=++cnt;
    if(t==3) a[u-1][v]=a[u-1][v+1]=a[u][v+1]=a[u+1][v]=++cnt;
    if(t==4) a[u-1][v]=a[u-1][v+1]=a[u][v-1]=a[u][v+1]=++cnt;
    if(t==5) a[u][v-1]=a[u][v+1]=a[u+1][v]=a[u+1][v+1]=++cnt;
    if(t==6) a[u-1][v]=a[u][v+1]=a[u+1][v]=a[u+1][v+1]=++cnt;
    if(t==7) a[u-1][v]=a[u][v-1]=a[u+1][v-1]=a[u+1][v]=++cnt;
    if(t==8) a[u][v-1]=a[u][v+1]=a[u+1][v-1]=a[u+1][v]=++cnt;
}
il void c1(int dx,int dy,int x,int y,int t){
    if(t==1) init(dx,dy,x+1,y+1,1),init(dx,dy,x+1,y+2,4);
    if(t==2) init(dx,dy,x+1,y+1,2),init(dx,dy,x+2,y+1,7);
}
il void c2(int dx,int dy,int x,int y,int t){
    if(t==1) init(dx,dy,x-1,y-1,4),init(dx,dy,x-1,y-2,6);
    if(t==2) init(dx,dy,x-1,y+1,1),init(dx,dy,x-1,y+2,7);
    if(t==3) init(dx,dy,x+2,y+1,1),init(dx,dy,x+1,y+1,3);
    if(t==4) init(dx,dy,x+1,y-1,2),init(dx,dy,x+2,y-1,4);
}
il void c3(int dx,int dy,int x,int y,int t){
    if(t==1) init(dx,dy,x+1,y+1,1),init(dx,dy,x+1,y+2,5);
    if(t==2) init(dx,dy,x+1,y+1,2),init(dx,dy,x+2,y+1,6);
    if(t==3) init(dx,dy,x+1,y,3),init(dx,dy,x+2,y,7);
    if(t==4) init(dx,dy,x+1,y,4),init(dx,dy,x+1,y-1,8);
}
il void solve(int n,int dx,int dy){
    if(n<=2) return ;
    if(n==3) {c2(dx,dy,3,3,1);return ;}
    if(n==5){c2(dx,dy,3,3,1),c1(dx,dy,1,4,2),init(dx,dy,5,2,1);return ;}
    if(n==7){
        c2(dx,dy,3,3,1),c1(dx,dy,1,4,2),init(dx,dy,5,2,1);
        c1(dx,dy,1,6,2),c1(dx,dy,6,1,1),c2(dx,dy,5,5,3);
        return ;
    }
    if(n==9){
        c1(dx,dy,1,1,1),c1(dx,dy,1,8,2),c1(dx,dy,8,6,1),c1(dx,dy,6,1,2);
        c2(dx,dy,5,3,1),c2(dx,dy,3,5,2),c2(dx,dy,5,7,3),c2(dx,dy,7,5,4);
        c3(dx,dy,5,3,1),c3(dx,dy,3,4,1);return ;
    }
    if(n%4==0){
        for(int i=1;i+1<=n;i+=2)
            for(int j=1;j+3<=n;j+=4) c1(dx,dy,i,j,1);
        return ;
    }
    if(n%4==2){
        solve(n-2,dx,dy);
        for(int i=1;i+3<=n;i+=4) c1(dx,dy,n-1,i,1);
        for(int i=1;i+3<=n;i+=4) c1(dx,dy,i,n-1,2); 
        return ;
    }
    if(n%4==1){
        solve(n-4,dx+2,dy);
        for(int i=1;i+8<=n;i+=4) c1(dx,dy,1,i,1),c1(dx,dy,n-1,i,1);
        c2(dx,dy,3,n-4,2),c1(dx,dy,1,n-1,2);
        c3(dx,dy,n-3,n-3,3),c2(dx,dy,n-2,n-2,3);
        for(int i=4;i<=n-5;i+=2) c3(dx,dy,i,n-3,1);
        return ;
    }
    if(n%4==3){
        solve(n-2,dx,dy);
        for(int i=1;i+3<=n;i+=4) c1(dx,dy,n-1,i,1);
        for(int i=1;i+3<=n;i+=4) c1(dx,dy,i,n-1,2);
        c2(dx,dy,n-2,n-2,3);return ;
    }
}
int T,n;
int main(){
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);cnt=0;
        for(int i=1;i<=n;++i) for(int j=1;j<=n;++j) a[i][j]=0;
        solve(n,0,0);
        printf("%d\n",cnt);
        for(int i=1;i<=n;++i) for(int j=1;j<=n;++j) printf("%d%c",a[i][j],j==n?'\n':' ');
    }
    return 0;
}