#include <stdio.h>

int main () {
  int n = 0;
  
  int res = 0;
  
  int a[1024][1024] = {};
  
  res = scanf("%d", &n);
  
  if (n <= 1) {
    printf("-1\n");
    return 0;
  }
  
  for (int i = 0; i < (1<<n); i++) {
    for (int j = 0; j < (1<<n); j++) {
      a[i][j] = ((i<<n)|j);
    }
  }
  
  for (int i = 0; i < (1<<(n-1)); i++) {
    int swap = a[2*i][(2*(i+1))%(1<<n)];
    a[2*i][(2*(i+1))%(1<<n)] = a[2*i+1][(2*(i+1))%(1<<n)];
    a[2*i+1][(2*(i+1))%(1<<n)] = swap;
    a[2*i][2*i] = ((2*i)<<n)+2*i+1;
    a[2*i][2*i+1] = ((2*i+1)<<n)+2*i+1;
    a[2*i+1][2*i] = ((2*i+1)<<n)+2*i;
    a[2*i+1][2*i+1] = ((2*i)<<n)+2*i;
  }
  
  for (int i = 0; i < (1<<n); i++) {
    printf("%d", a[i][0]);
    for (int j = 1; j < (1<<n); j++) {
      printf(" %d", a[i][j]);
    }
    printf("\n");
  }
  
  return 0;
}