#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int n;
bitset<N> e[N];
int c(int a, int b) { return a + b > 6 ? a + b - 6 : a + b; }
void write(long long a) {
  if (a >= 10) write(a / 10);
  putchar(a % 10 + 48);
}
void zeng(int l, int r) {
  for (int i = l; i <= r; i += 2) {
    for (int j = 1; j < i; j++) e[i][j] = e[j][i + 1] = 1;
    e[i + 1][i] = 1;
  }
}
signed main() {
  scanf("%d", &n);
  if (n == 4) {
    puts("-1");
    return 0;
  }
  if (n % 2 == 1) {
    e[1][2] = e[2][3] = e[3][1] = 1;
    zeng(4, n);
  } else {
    for (int i = 1; i <= 6; i++) {
      e[i][c(i, 1)] = 1;
      if (i & 1)
        e[i][c(i, 3)] = e[i][c(i, 2)] = 1;
      else
        e[i][c(i, 4)] = 1;
    }
    zeng(7, n);
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) write(e[i][j]), putchar(' ');
    puts("");
  }
}
