#include <bits/stdc++.h>
using namespace std;
int N, a[1005][1005];
void doit() {
  scanf("%d", &N);
  if (N == 4) {
    puts("-1");
    return;
  }
  if (N % 2 == 0) {
    for (int i = 0; i < 6; i++) a[i][(i + 1) % 6] = 1;
    a[0][2] = a[2][4] = a[4][0] = 1;
    a[1][5] = a[3][1] = a[5][3] = 1;
    a[0][3] = a[1][4] = a[2][5] = 1;
  }
  for (int i = N - 1; (N & 1 && i > 0) || (N % 2 == 0 && i > 6); i -= 2) {
    a[i - 1][i] = 1;
    for (int j = 0; j < i - 1; j++) a[i][j] = a[j][i - 1] = 1;
  }
  for (int i = 0; i < N; i++)
    for (int j = 0; j < N; j++)
      printf("%d%c", a[i][j], j == N - 1 ? '\n' : ' ');
}
int main() {
  doit();
  return 0;
}
