#include <bits/stdc++.h>
using namespace std;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, -1, 1};
void arquivo() {
  freopen("", "r", stdin);
  freopen("", "w", stdout);
}
const int N = 1001;
int n, m;
int ans[N][N];
int main() {
  scanf("%d", &n);
  if (n == 4) {
    puts("-1");
    return 0;
  }
  m = n - 1 + (n & 1);
  swap(n, m);
  for (int i = 1; i <= n; ++i) {
    int k = (i == n) ? 1 : i + 1;
    while (1) {
      if (k == i) break;
      ans[i][k] = 1;
      k += 2;
      k -= (k > n) ? n : 0;
    }
  }
  if (n != m) {
    ans[m][1] = ans[m][2] = 1;
    for (int i = 3; i < m; ++i) ans[i][m] = 1;
  }
  swap(n, m);
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      printf("%c ", ans[i][j] + '0');
    }
    printf("\n");
  }
  return 0;
}
