#include <bits/stdc++.h>
using namespace std;

const int N = 1 << 10;

int n, a[N][N], cnt;

void solve(int xl, int xr, int yl, int yr, bool t) {
    if(xr - xl == 2) {
        if(t) {
            a[xl][yl] = cnt ++;
            a[xl + 1][yl + 1] = cnt ++;
            a[xl + 1][yl] = cnt ++;
            a[xl][yl + 1] = cnt ++;
        }else{
            a[xl][yl] = cnt ++;
            a[xl + 1][yl + 1] = cnt ++;
            a[xl][yl + 1] = cnt ++;
            a[xl + 1][yl] = cnt ++;
        }
        return;
    }
    solve(xl, xl + xr >> 1, yl, yl + yr >> 1, t);
    solve(xl + xr >> 1, xr, yl, yl + yr >> 1, 0);
    solve(xl, xl + xr >> 1, yl + yr >> 1, yr, 0);
    solve(xl + xr >> 1, xr, yl + yr >> 1, yr, t);
}

int main() {
    cin >> n;
    if(n == 1) {
        puts("-1");
        return 0;
    }

    solve(0, 1 << n, 0, 1 << n, 1);

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