#include<cstdio>
#include<algorithm>
using namespace std;
int a[305][305];
void Make_Graph(int N)
{
    if(N==3) {a[1][2]=a[2][3]=a[3][1]=1;return;}
    if(N==4) return;
    if(N==6)
    {
        a[1][2]=a[1][3]=a[1][4]=1;
        a[2][3]=a[2][4]=a[2][5]=1;
        a[3][4]=a[3][6]=1;
        a[4][5]=a[4][6]=1;
        a[5][1]=a[5][3]=a[5][6]=1;
        a[6][1]=a[6][2]=1;
        return;
    }
    for(int i=1;i<=N-2;++i)
        a[i][N-1]=a[N][i]=1;
    a[N-1][N]=1;
    Make_Graph(N-2);
}
int main()
{
    freopen("oras.in","r",stdin);
    freopen("oras.out","w",stdout);
    int n;
    scanf("%d",&n);
    Make_Graph(n);
    if(n==4)
    {
        printf("-1\n");
        return 0;
    }
    for(int i=1;i<=n;i++,printf("\n"))
        for(int j=1;j<=n;j++)
            printf("%d",a[i][j]);
    return 0;
}