def solve(n): if n==2: ans=[[7,14,0,8],[4,12,2,11],[15,9,6,1],[13,10,5,3]] return ans res=solve(n-1) ans=[[0]*(1<<n) for i in range(1<<n)] for i in range(1<<(n-1)): for j in range(1<<(n-1)): ans[i][j]=res[i][j] ans[i+(1<<(n-1))][j+(1<<(n-1))]=res[i][j]+(1<<((n-1)*2)) now=1<<(2*n-1) for i in range(1<<(n-1)): for j in range(1<<(n-1)): ans[i+(1<<(n-1))][j]=now now+=1 for i in range(1<<(n-1)): for j in range(1<<(n-1)): ans[i][j+(1<<(n-1))]=now now+=1 return ans n=int(input()) if n==1: print(-1) exit() ans=solve(n) row=[0]*(1<<n) col=[0]*(1<<n) for i in range(1<<n): for j in range(1<<n): row[i]^=ans[i][j] col[j]^=ans[i][j] if row!=[1]*(1<<n) or col!=[1]*(1<<n): raise Exception for i in ans: print(*i)