// PA2025 runda 5B - https://sio2.mimuw.edu.pl/c/pa-2025-1/p/mig/
//-std=c++20
#include<iostream>
#include<vector>
#include<list>
#include<algorithm>

using namespace std;
bool mig[100][100];

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

    mig[0][1] = true;
    int k=0;
    while(k<41){
        for (int i = k+1; i < 100-k; i++) {
            mig[i][k] = true;
        }
        for (int j = k+2; j < 100-k; j++) {
            mig[99-k][j] = true;
        }
        for (int i = 99-k-3; i >= k; i--) {
            mig[i][99-k] = true;
        }
        for (int j=99-k-3; j>k+4;j--){
            mig[k][j] = true;
        }
        k+=3;
    }


    for (int i = 0; i < 100; i++) {
        for (int j = 0; j < 100; j++) {
            cout << (mig[i][j] ? '1' : '0');
        }
        cout << '\n';
    }
}