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

#define double long double

using ll = long long;
using VB = vector<bool>;
using VVB = vector<VB>;
using VVVB = vector<VVB>;
using VC = vector<char>;
using VVC = vector<VC>;
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
using VVVVI = vector<VVVI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
using VVVVL = vector<VVVL>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
//using P = pair<int, int>;

#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define ALL(a) (a).begin(),(a).end()

constexpr int INF = 1001001001;
constexpr ll LINF = 1001001001001001001ll;
constexpr int DX[] = {2, 1, -1, -2, -2, -1, 1, 2};
constexpr int DY[] = {1, 2, 2, 1, -1, -2, -2, -1};

template< typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true); }
template< typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true); }

const ll MOD = 998244353;

const int MAX_N = 400010;
int par[MAX_N];
int rnk[MAX_N];
int siz[MAX_N];

void init(int n) {
    REP(i,n) {
        par[i] = i;
        rnk[i] = 0;
        siz[i] = 1;
    }
}

int find(int x) {
    if (par[x] == x) {
        return x;
    } else {
        return par[x] = find(par[x]);
    }
}

void unite(int x, int y) {
    x = find(x);
    y = find(y);
    if (x == y) return;
    int s = siz[x] + siz[y];
    if (rnk[x] < rnk[y]) {
        par[x] = y;
    } else {
        par[y] = x;
        if (rnk[x] == rnk[y]) rnk[x]++;
    }
    siz[find(x)] = s;
}

bool same(int x, int y) {
    return find(x) == find(y);
}

int size(int x) {
    return siz[find(x)];
}

ll mod_pow(ll x, ll n, ll mod) {
    ll res = 1;
    x %= mod;
    while (n > 0) {
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

ll gcd(ll x, ll y) {
    if (y == 0) return x;
    return gcd(y, x % y);
}

typedef pair<double, int> P0;
struct edge { int to; double cost; };

const int MAX_V = 200000;
//const ll LINF = 1LL<<60;

int V;
vector<edge> G[MAX_V];
double d[MAX_V];

void dijkstra(ll s) {
    // greater<P>を指定することでfirstが小さい順に取り出せるようにする
    priority_queue<P0, vector<P0>, greater<P0> > que;
    fill(d, d + V, LINF);
    d[s] = 0;
    que.push(P0(0, s));

    while (!que.empty()) {
        P0 p = que.top(); que.pop();
        int v = p.second;
        if (d[v] < p.first) continue;
        REP(i,G[v].size()) {
            edge e = G[v][i];
            if (d[e.to] > d[v] + e.cost) {
                d[e.to] = d[v] + e.cost;
                que.push(P0(d[e.to], e.to));
            }
        }
    }
}

/*
VL f(51, 1);

ll C(ll n, ll k) {
    return f[n] * mod_pow(f[k], MOD - 2, MOD) % MOD * mod_pow(f[n - k], MOD - 2, MOD) % MOD;
}
*/

int main() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    //REP(i, 50) f[i + 1] = f[i] * (i + 1) % MOD;
    int N;
    cin >> N;
    if (N == 1) {
        cout << -1 << endl;
        return 0;
    }
    int M = 1 << N;
    VVI a(M, VI(M, 0));
    REP(i, M) REP(j, i) a[i][j] = 1;
    REP(i, M) {
        if (i % 4 == 0) {
            a[i][i] = 1;
            a[i][i + 1] = 0;
        }
        if (i % 4 == 1) {
            a[i][i] = 1;
            a[i][i - 1] = 0;
        }
        if (i % 4 == 2) {
            a[i][i] = 0;
            a[i][i + 1] = 1;
        }
        if (i % 4 == 3) {
            a[i][i] = 0;
            a[i][i - 1] = 1;
        }
    }
    int X = 0;
    REP(i, M / 2) REP(j, M) {
        a[i][j] += X;
        a[M - 1 - i][M - 1 - j] += X;
        X += 2;
    }
    REP(i, M) {
        REP(j, M) {
            cout << a[i][j];
            if (j < M - 1) cout << " ";
        }
        cout << endl;
    }
}