#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

typedef long long ll;

const ll mod=1e9+7;

const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};

#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define rc(x)  return cout<<x<<"\n",0
#define sz(s)  (int) s.size()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define PI 3.14159265358979

using namespace std;

ll t,n;

void solve() {
	cin >> n;
	bool u=true;
	ll cnt1=1,cnt2=n*n;
	if (n==2) {
		cout << "-1\n";
	}
	else {
			
		ll a[n+2][n+2];
		for (int i=1; i<=n; i++) {
			for (int j=1; j<=n; j++) {
				if (i%2) {
					if (j%2) {
						a[i][j]=cnt1;
						cnt1++;	
					}
					else {
						a[i][j]=cnt2;
						cnt2--;
					}
				}
				if (!(i%2)) {
					if (j%2) {
						a[i][j]=cnt2;
						cnt2--;
					}
					else {
						a[i][j]=cnt1;
						cnt1++;	
					}
				}
			}
		}
		swap(a[1][1],a[n][n]);
		for (int i=1; i<=n; i++) {
			for (int j=1; j<=n; j++) {
				cout << a[i][j] << " ";
			}
			cout << '\n';
		}
	}
}

int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	t=1;
	cin >> t;
	while (t--) {
		solve();
	}

}
