#include <bits/stdc++.h>
using namespace std;
bool ans[1010][1010];
int arr[110] = {0, 1, 0, 2, 0, 3, 1, 2, 1, 3, 1, 4, 2, 3, 2,
                5, 3, 4, 3, 5, 4, 0, 4, 2, 4, 5, 5, 0, 5, 1};
void dfs(int a, int b) {
  if (b - a + 1 < 3) return;
  if (b - a + 1 == 3)
    ans[a][a + 1] = ans[a + 1][a + 2] = ans[a + 2][a] = 1;
  else if (b - a + 1 == 6) {
    for (int i = 0; i < 15; i++) ans[arr[i * 2] + a][arr[i * 2 + 1] + a] = 1;
    return;
  } else {
    ans[a][a + 1] = 1;
    for (int i = a + 2; i <= b; i++) ans[a + 1][i] = ans[i][a] = 1;
    dfs(a + 2, b);
  }
}
int main() {
  int n;
  scanf("%d", &n);
  if (n == 4) {
    puts("-1");
    return 0;
  }
  dfs(1, n);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++)
      if (ans[i][j])
        printf("1 ");
      else
        printf("0 ");
    puts("");
  }
}
