#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

vector<vector<int>> make_0(int n){
    int m = 1<<n;
    auto ans = vec2d(m, m, 0);
    for(int i = 0; i < m; i++){
        for(int j = 0; j < m; j++){
            ans[i][j] = i*m+j;
        }
    }
    return ans;
}

vector<vector<int>> solve(int n){
    if(n == 2){
        return {
            {7, 14, 0, 8},
            {4, 12, 2, 11},
            {15, 9, 6, 1},
            {13, 10, 5, 3}
        };
    }
    auto ans = vec2d(1<<n, 1<<n, 0);
    auto v = solve(n-1);
    auto u = make_0(n-1);
    int m = 1<<(n-1);
    int x = 1<<(2*n-2);
    for(int i = 0; i < m; i++){
        for(int j = 0; j < m; j++){
            ans[i][j] = v[i][j];
            ans[i][j+m] = x+u[i][j];
            ans[i+m][j] = 2*x+u[i][j];
            ans[i+m][j+m] = 3*x+v[i][j];
        }
    }
    return ans;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    if(n == 1){
        cout << -1 << endl;
        return 0;
    }
    auto ans = solve(n);
    for(auto u: ans) print_vector(u);
   
}