#include <bits/stdc++.h> 
#include <atcoder/all>

#define pub push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (ll i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
using namespace std;
using ll = long long;
using Pll = pair<ll, ll>;


using namespace atcoder;
using mint = modint998244353;
using mint2 = modint1000000007;

constexpr long long INF = (1LL << 60);
constexpr double EPS = 1e-9;
constexpr double PI = 3.141592653589;


template <typename T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;  // aをbで更新
        return true;
    }
    return false;
}

template <typename T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;  // aをbで更新
        return true;
    }
    return false;
}

template <typename T>
T sq(T x) {
    return x * x;
}

std::string zfill(int n, const int width)
{
    std::stringstream ss;
    ss << std::setw(width) << std::setfill('0') << n;
    return ss.str();
}

bool isp(ll num)
{
    if (num < 2) return false;
    else if (num == 2) return true;
    else if (num % 2 == 0) return false; // 偶数はあらかじめ除く

    double sqrtNum = sqrt(num);
    for (int i = 3; i <= sqrtNum; i += 2)
    {
        if (num % i == 0)
        {
            // 素数ではない
            return false;
        }
    }

    // 素数である
    return true;
}

template<typename T = int>
std::map<T, int> factorize(T n) {
    std::map<T, int> factor_map;
    for (T i = 2; i * i <= n; i++) {
        while (!(n % i)) {
            factor_map[i]++; n /= i;
        }
    }
    if (n > 1) factor_map[n]++;
    return factor_map;
}



int main() {
    ll N; cin >> N;
    if (N == 1) {
        cout << -1 << endl;
        return 0;
    }
    else {
        N--;
        vector<vector<vector<ll>>> ans(N);
        rep(i, N) {
            if (i == 0) {
                ans[i].pub({ 7,14,0,8 });
                ans[i].pub({ 4,12,2,11 });
                ans[i].pub({ 15,9,6,1 });
                ans[i].pub({ 13,10,5,3 });
            }
            else {
                ans[i] = ans[i - 1];
                ll t = 1 << (2 * (i + 1));
                rep(j, 1<<(i+1)) {
                    rep(k, 1<<(i + 1)) {
                        ans[i][j].pub(t);
                        t++;
                    }
                }
                rep(j, 1<<(i+1)) {
                    vector<ll> b;
                    rep(k, 1<<(i+1)) {
                        b.pub(t);
                        t++;
                    }
                    ans[i].pub(b);
                }
                rep(j, 1<<(i+1)) {
                    rep(k, 1 << (i+1)) {
                        ans[i][j + (1<<(i+1))].pub(ans[i][j][k] + t);
                    }
                }
            }
        }
        rep(i, ans[N - 1].size()) {
            rep(j, ans[N - 1][i].size()) {
                cout << ans[N - 1][i][j] << " ";
            }
            cout << endl;
        }
    }
}