#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll MAX_N = 2e5;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    ll n;
    cin >> n;

    if(n==1){
        cout << -1 << endl;
        return 0;
    }

    vector<vector<vector<ll>>> a(n+1);
    //n=2の場合の初期化
    a[2].resize((1<<2), vector<ll>(1<<2));
    a[2]={
        {7, 14, 0, 8},
        {4, 12, 2, 11},
        {15, 9, 6, 1},
        {13, 10, 5, 3}
    };

    for(ll x=3; x<=n; x++){
        a[x].resize((1<<x), vector<ll>((1<<x)));
        //左上
        for(ll i=0; i<(1<<(x-1)); i++) for(ll j=0; j<(1<<(x-1)); j++) a[x][i][j] = a[x-1][i][j];
        //右上
        for(ll i=0; i<(1<<(x-1)); i++) for(ll j=(1<<(x-1)); j<(1<<x); j++){
            a[x][i][j] = (1<<(2*x-2))+i*(1<<(x-1))+(j-(1<<(x-1)));
        }
        //左下
        for(ll i=(1<<(x-1)); i<(1<<x); i++) for(ll j=0; j<(1<<(x-1)); j++){
            a[x][i][j] = (1<<(2*x-1))+(i-(1<<(x-1)))*(1<<(x-1))+j;
        }
        //右下
        for(ll i=(1<<(x-1)); i<(1<<x); i++) for(ll j=(1<<(x-1)); j<(1<<x); j++){
            a[x][i][j] = (1<<(2*x-1))+(1<<(2*x-2))+a[x-1][i-(1<<(x-1))][j-(1<<(x-1))];
        }
    }

    for(ll i=0; i<(1<<n); i++){
        for(ll j=0; j<(1<<n); j++){
            cout << a[n][i][j] << " ";
        }
        cout << endl;
    }
}