#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	if (1 == n) {
		cout << -1 << endl;
		return 0;
	}
	vector<vector<int>>v = { {7,14,0,8},{4,12,2,11,},{15,9,6,1},{13,10,5,3} };
	n -= 2;
	int sz = 4;
	while (n) {
		vector<vector<int>>w(sz, vector<int>(sz));
		rep(i, w.size())rep(j, w[i].size()) w[i][j] = i * sz + j;
		vector<vector<int>>nv(sz * 2, vector<int>(sz * 2));
		rep(i, w.size())rep(j, w[i].size())nv[i][j] = v[i][j];
		rep(i, w.size())rep(j, w[i].size())nv[i][j + sz] = w[i][j] + sz * sz;
		rep(i, w.size())rep(j, w[i].size())nv[i + sz][j] = w[i][j] + sz * sz * 2;
		rep(i, w.size())rep(j, w[i].size())nv[i + sz][j + sz] = v[i][j] + sz * sz * 3;
		swap(v, nv);
		n--;
		sz *= 2;
	}
	rep(i, v.size()) {
		rep(j, v[i].size())cout << v[i][j] << " ";
		cout << endl;
	}
	return 0;
}