#include <bits/stdc++.h>
using namespace std;
const int MAX_SIZE = 100000 + 10;
vector<int> adj[1000 + 10];
void build(int n, int last) {
  if (n == last)
    return;
  else {
    n++;
    for (int i = n / 2; i < n; i++) adj[n].push_back(i);
    for (int i = 1; i < n / 2; i++) adj[i].push_back(n);
    for (int i = n / 2; i < n; i++) adj[i].push_back(n + 1);
    for (int i = 1; i < n / 2; i++) adj[n + 1].push_back(i);
    adj[n + 1].push_back(n);
    n++;
    build(n, last);
  }
}
int main() {
  int n;
  scanf("%d", &n);
  if (n == 4)
    cout << -1;
  else if (n == 1)
    cout << 0;
  else {
    adj[1].push_back(2);
    adj[2].push_back(3);
    adj[3].push_back(1);
    if (n % 2 == 0) {
      build(3, 5);
      for (int i = 1; i < 3; i++) adj[i].push_back(6);
      for (int i = 3; i <= 5; i++) adj[6].push_back(i);
      build(6, n);
    } else {
      build(3, n);
    }
    int last;
    for (int i = 1; i <= n; i++) {
      last = 1;
      for (int j = 0; j < (int)adj[i].size(); j++) {
        for (int k = last; k < adj[i][j]; k++) printf("0 ");
        printf("1 ");
        last = adj[i][j] + 1;
      }
      for (int k = last; k <= n; k++) printf("0 ");
      printf("\n");
    }
  }
  return 0;
}
