t=int(input())
for i in range(t):
n=int(input())
if n==2 :
print(-1)
else:
cnt=1
for j in range(n):
for q in range(n):
if cnt<=n*n :
print(cnt,end=' ')
cnt+=2
else:
cnt=2
print(cnt, end=' ')
cnt+=2
print(" ") #include <bits/stdc++.h>
using namespace std;
int main () {
ios_base :: sync_with_stdio(false);
int t;
cin>>t;
while(t--){
int n;
cin>>n;
if(n==2) cout<<-1<<endl;
else{
for(int i=1; i<=n*n; i+=2) cout<<i<<' ';//1...9->1,3,5,7,9
for(int i=2; i<=n*n; i+=2) cout<<i<<' ';//2...9->2,4,6,8
cout<<endl;
}
}
return 0;
}237A - Free Cash | 1615B - And It's Non-Zero |
1619E - MEX and Increments | 34B - Sale |
1436A - Reorder | 1363C - Game On Leaves |
1373C - Pluses and Minuses | 1173B - Nauuo and Chess |
318B - Strings of Power | 1625A - Ancient Civilization |
864A - Fair Game | 1663B - Mike's Sequence |
448A - Rewards | 1622A - Construct a Rectangle |
1620A - Equal or Not Equal | 1517A - Sum of 2050 |
620A - Professor GukiZ's Robot | 1342A - Road To Zero |
1520A - Do Not Be Distracted | 352A - Jeff and Digits |
1327A - Sum of Odd Integers | 1276A - As Simple as One and Two |
812C - Sagheer and Nubian Market | 272A - Dima and Friends |
1352C - K-th Not Divisible by n | 545C - Woodcutters |
1528B - Kavi on Pairing Duty | 339B - Xenia and Ringroad |
189A - Cut Ribbon | 1182A - Filling Shapes |