#include "bits/stdc++.h"
using namespace std;
#define all(x) begin(x),end(x)
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { string sep; for (const T &x : v) os << sep << x, sep = " "; return os; }
#define debug(a) cerr << "(" << #a << ": " << a << ")\n";
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
const int mxN = 1<<10, oo = 1e9;
int g[mxN][mxN];
int main() {
    // ok xor of everything is 0 or 
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n; cin >> n;
    // cout << n << ": " << '\n';
    int xr=0;
    for(int i=0;i<1<<(n*2);++i) xr^=i;
    int len = 1<<(n);
    int want = len%2;
    // independent for the bits!
    // helft van de bits moet aan, even aantal in elke kolom/rij
    // do bit pattern across rows and across columns
    // need to put the ones
    if(xr!=want or n==1) {
        cout << "-1\n";
        exit(0);
    }
    
    for(int i=0;i<len;++i) {
        for(int j=0;j<len;++j) {
            g[i][j] = i<<1 &( len-1);
            if(i>=len/2) g[i][j]^=1;
            if(i==j) g[i][j]^=1;
            g[i][j]^=j<<n;
            g[i][j]^=(i>=len/2)<<(2*n-1);
        }
    }


    for(int i=0;i<len;++i) {
        cout << vi(g[i],g[i]+len) << '\n';
    }
}