
// #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp> 
// using namespace boost::multiprecision; 
using namespace std;
typedef long long ll;
// #define ll int
typedef unsigned long long ull;
#define cu continue
#define br break
#define pb push_back
#define eb emplace_back
#define mod 1000000007
#define inf 10000000000000
#define pll pair <ll,ll>
#define min_pq priority_queue<pll,vector <pll>, greater <pll> >  
#define ar array
#define F first
#define S second
#define var(n) vector<ar<ll,n>>
#define vll vector <ll>
#define vpll vector <pll>
#define dbg(n) cout<<#n<<' '<<n<<endl;
#define all(v) v.begin(),v.end()
#define nl cout<<'\n'

template <class A1>
void prn(A1&& arg)
{
    cout<<arg<<'\n';
}
template <class A1, class... A>
void prn(A1&& arg, A&&... args)
{
    cout<<arg<<' ';
    prn(args...);
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    #ifndef ONLINE_JUDGE
    freopen("/home/dinesh_verra/cpp/input.txt","r",stdin);
    // freopen("/home/dinesh_verra/cpp/A.txt","w",stdout);
    #endif

   	ll t;
   	cin>>t;
   	while(t--) {

   		ll n;
   		cin>>n;
   		if(n==1) {
   			prn(1);
   			cu;
   		}
   		if(n==2) {
   			prn(-1);
   			cu;
   		}
   		ll a[n][n],cnt=n+1;
   		for(ll i=0;i<n;i++) a[i][i]=i+1;
   		for(ll k=2;k<n;k++) {
   			for(ll i=0;i<=n-k;i++) {
   				ll j=i+k-1;
   				a[i][j]=cnt++;
   			}
   		}
   		for(ll k=2;k<n;k++) {
   			for(ll i=0;i<=n-k;i++) {
   				ll j=i+k-1;
   				a[j][i]=cnt++;
   			}
   		}
   		a[0][n-1]=cnt++;
   		a[n-1][0]=cnt;
   		for(ll i=0;i<n;i++,nl)
   			for(ll j=0;j<n;j++) cout<<a[i][j]<<' ';
   	}
}