#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;

using Modint = atcoder::static_modint<998244353>;


int main(){
    int N; cin >> N;
    if(N == 1){ cout << "-1\n"; return 0; }
    vector<int> Q((1<<N)<<N);
    vector<int> A(1<<N), B(1<<N);
    rep(i,1<<N) rep(j,1<<N){
        int h = i ^ j;
        int l = i;
        if(i == j) l ^= 1;
        Q[(i<<N)+j] = ((h << N) + l);
        A[i] ^= Q[(i<<N)+j];
        B[j] ^= Q[(i<<N)+j];
    }
    rep(i,1<<N){
        rep(j,1<<N){
            if(j) cout << ' ';
            cout << Q[(i<<N)+j];
        }
        cout << '\n';
    }
    return 0;
}



struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;