import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt;
      
      if (N == 1) {
        writeln(-1);
      } else {
        auto a = new int[][](1 << N, 1 << N);
        foreach (x; 0 .. 1 << (N - 1)) {
          foreach (y; 0 .. 1 << N) {
            a[x][y] = a[$ - 1 - x][$ - 1 - y] = x << N | y;
          }
        }
        foreach (x; 0 .. 1 << N) foreach (y; 0 .. 1 << N) {
          int b;
          if (x / 2 > y / 2) {
            b = 0;
          }   else if (x / 2 < y / 2) {
            b = 1;
          } else {
            b = (x ^ y) & 1;
            if (x >= 1 << (N - 1)) {
              b ^= 1;
            }
          }
          a[x][y] = a[x][y] << 1 | b;
        }
        
        foreach (x; 0 .. 1 << N) {
          foreach (y; 0 .. 1 << N) {
            if (y) write(" ");
            write(a[x][y]);
          }
          writeln;
        }
        
        debug {
          auto row = new int[1 << N];
          auto col = new int[1 << N];
          foreach (x; 0 .. 1 << N) foreach (y; 0 .. 1 << N) {
            row[x] ^= a[x][y];
            col[y] ^= a[x][y];
          }
          writeln("row = ", row);
          writeln("col = ", col);
        }
      }
    }
  } catch (EOFException e) {
  }
}