#include <bits/stdc++.h>
using namespace std;
int a[1005][1005];
int n;
int wz;
int main() {
  scanf("%d", &n);
  if (n % 2 == 1 && n == 1) {
    puts("-1");
    return 0;
  }
  if (n % 2 == 0 && n <= 4) {
    puts("-1");
    return 0;
  }
  if (n % 2 == 1) {
    wz = 4;
    a[1][2] = 1;
    a[2][3] = 1;
    a[3][1] = 1;
  } else {
    wz = 7;
    a[1][5] = a[1][6] = 1;
    a[2][1] = a[2][4] = a[2][6] = 1;
    a[3][1] = a[3][2] = 1;
    a[4][1] = a[4][3] = 1;
    a[5][2] = a[5][3] = a[5][4] = 1;
    a[6][3] = a[6][4] = a[6][5] = 1;
  }
  while (wz <= n) {
    int wz1 = wz + 1;
    a[wz][wz1] = 1;
    for (int i = 1; i <= wz - 1; i++) {
      a[i][wz] = 1;
      a[wz1][i] = 1;
    }
    wz += 2;
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) printf("%d ", a[i][j]);
    puts("");
  }
  return 0;
}
