#include <bits/stdc++.h>
using namespace std;
const int M = 1005;
int a[M][M];
void solve(int n) {
  if (n == 3) {
    a[0][1] = a[1][2] = a[2][0] = 1;
    return;
  }
  if (n == 6) {
    a[0][1] = a[1][2] = a[2][0] = 1;
    a[3][4] = a[4][5] = a[5][3] = 1;
    a[1][3] = a[0][4] = a[2][5] = 1;
    a[5][0] = a[5][1] = 1;
    a[4][1] = a[4][2] = 1;
    a[3][0] = a[3][2] = 1;
    return;
  }
  a[n - 2][n - 1] = 1;
  for (int i = 0; i < n - 2; i++) a[i][n - 2] = a[n - 1][i] = 1;
  solve(n - 2);
}
int32_t main() {
  int n;
  cin >> n;
  if (n == 4) return cout << -1 << endl, 0;
  solve(n);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) printf("%d ", a[i][j]);
    cout << endl;
  }
  return 0;
}
