n = int(input())

if n == 1:
	print(-1)
	exit()

b = [[0]*(1<<n) for i in range(1<<n)]
for i in range(1<<n):
	for j in range(1<<n):
		t = (i*(1<<n) + j) % (1<<2*n)
		b[i][j] = t ^ (t >> 1)

#print(b,sep="\n")
for i in range(1<<(n-1)):	
	b[i][i], b[(1<<n)-1-i][(1<<n)-1-i] = b[(1<<n)-1-i][(1<<n)-1-i], b[i][i]

f = 1 << n
mask = (1 << 2*n) - 1
for i in range(f):
	for j in range(f):
		b[i][j] = ((b[i][j] << 1) & mask) + ((b[i][j] & (1 << 2*n-1)) >> 2*n-1)

#print(b,sep="\n")
for i in range(f):
	print(*b[i])