import sys
from collections import deque, Counter
sys.setrecursionlimit(5 * 10 ** 5)
from pypyjit import set_param
set_param('max_unroll_recursion=-1')
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353

n = ii()


def solve(n):
    if n == 0:
        return [[0,],]
    if n == 1:
        return [[0, 1], [2, 3]]
    else:
        X = solve(n - 1)
        ans = [[0] * (1<<n) for _ in range(1<<n)]
        for i in range(1 << (n - 1)):
            for j in range(1<<(n - 1)):
                ans[i][j] = X[i][j]
                
        for i in range(1 << (n - 1), 1<<n):
            for j in range(1<<(n - 1)):
                ans[i][j] = X[i - (1<<(n-1))][j] + 2 ** (2 * n - 2)
        
        for i in range(1 << (n - 1)):
            for j in range(1 << (n - 1), 1<<n):
                ans[i][j] = X[i][j - (1<<(n-1))] + 2 ** (2 * n - 1)
        
        for i in range(1 << (n - 1), 1<<n):
            for j in range(1 << (n - 1), 1<<n):
                ans[i][j] = X[i - (1<<(n-1))][j - (1<<(n-1))] + 2 ** (2 * n - 1) + 2 ** (2 * n - 2)
        return ans

ans = solve(n)
if n == 1:
    print(-1)
else:
    for v in ans:
        print(*v)