#include <bits/stdc++.h>
using namespace std;
const int N = 1009;
int n, e[N][N], base[2] = {6, 3};
int main() {
  scanf("%d", &n);
  if (n == 4) {
    printf("-1");
    return 0;
  }
  if (n % 2 == 1) {
    e[1][2] = 1;
    e[2][3] = 1;
    e[3][1] = 1;
  } else {
    e[1][2] = 1;
    e[1][3] = 1;
    e[1][4] = 1;
    e[2][3] = 1;
    e[2][4] = 1;
    e[2][5] = 1;
    e[3][4] = 1;
    e[3][6] = 1;
    e[4][5] = 1;
    e[4][6] = 1;
    e[5][1] = 1;
    e[5][3] = 1;
    e[5][6] = 1;
    e[6][1] = 1;
    e[6][2] = 1;
  }
  for (int i = base[n % 2] + 2; i <= n; i += 2) {
    for (int j = 1; j <= i - 2; j++) {
      e[i][j] = e[j][i - 1] = 1;
    }
    e[i - 1][i] = 1;
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      printf("%d ", e[i][j]);
    }
    printf("\n");
  }
  return 0;
}
