#include <bits/stdc++.h>
using namespace std;
using namespace std;
inline long long pow_mod(long long X, long long N, long long mod) {
  long long res = 1;
  while (N > 0) {
    if (N & 1) res = res * X % mod;
    X = X * X % mod;
    N >>= 1;
  }
  return res;
}
const long long SI = 1e5 + 100;
const long long mod = 1e9 + 7;
int a[1005][1005];
int N;
int main() {
  scanf("%d", &N);
  if (N & 1) {
    a[1][2] = 1;
    a[2][3] = 1;
    a[3][1] = 1;
    for (int i = 5; i <= N; i += 2) {
      a[i - 1][i] = 1;
      for (int j = i - 2; j >= 1; j--) a[i][j] = a[j][i - 1] = 1;
    }
    for (int i = 1; i <= N; i++)
      for (int j = 1; j <= N; j++)
        if (j == N)
          printf("%d\n", a[i][j]);
        else
          printf("%d ", a[i][j]);
    return 0;
  }
  if (N == 4) {
    puts("-1");
    return 0;
  }
  a[1][2] = 1;
  a[2][3] = 1;
  a[3][1] = 1;
  a[4][5] = 1;
  a[5][6] = 1;
  a[6][4] = 1;
  a[3][4] = 1;
  a[3][6] = 1;
  a[5][3] = 1;
  a[6][2] = 1;
  a[2][5] = 1;
  a[4][2] = 1;
  a[1][6] = 1;
  a[4][1] = 1;
  a[5][1] = 1;
  for (int i = 8; i <= N; i += 2) {
    a[i - 1][i] = 1;
    for (int j = i - 2; j >= 1; j--) a[i][j] = a[j][i - 1] = 1;
  }
  for (int i = 1; i <= N; i++)
    for (int j = 1; j <= N; j++)
      if (j == N)
        printf("%d\n", a[i][j]);
      else
        printf("%d ", a[i][j]);
  return 0;
}
