#include <bits/stdc++.h>
using namespace std;
const int MAX = 1005;
int adj[MAX][MAX];
void solve(int n) {
  if (n == 3) {
    adj[1][2] = adj[2][3] = adj[3][1] = 1;
    return;
  }
  if (n == 6) {
    adj[1][2] = adj[1][3] = adj[1][4] = adj[2][3] = adj[2][5] = adj[3][4] =
        adj[3][5] = adj[3][6] = adj[4][2] = adj[4][5] = adj[4][6] = adj[5][1] =
            adj[5][6] = adj[6][1] = adj[6][2] = 1;
    return;
  }
  solve(n - 2);
  for (int i = 1; i <= n - 2; i++) adj[i][n - 1] = 1;
  adj[n - 1][n] = 1;
  for (int i = 1; i <= n - 2; i++) adj[n][i] = 1;
}
int main() {
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  if (n == 4) {
    cout << -1;
    return 0;
  }
  solve(n);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) cout << adj[i][j] << " ";
    cout << endl;
  }
  return 0;
}
