#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n;
    cin>>n;
    vector<vector<int>> ans(n,vector<int>(n,0));

    auto dfs = [&](auto dfs,int le,int ri) -> void {
        int len = ri - le;
        if(len==2){
            ans[le][le] = 0;
            ans[le][le+1] = 1;
            ans[le+1][le] = ans[le+1][le+1] = 2;
            return;
        }
        dfs(dfs,le+1,ri-1);
        ans[le][ri-1] = 1;
        for(int i = le;i<ri;i++) ans[ri-1][i] = 2;
        for(int i = le+1;i<ri;i++) ans[i][ri-1] = 2;
    };
    dfs(dfs,0,n);
    for(int i = 0;i<n;i++){
        for(int j = 0;j<n;j++) cout<<ans[i][j];
        cout<<endl;
    }

}