#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;


int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    int n;
    cin >> n;
    vector<vector<int>> tab(n + 2, vector<int>(n + 2, 0));

    // tab[0][0] = 3;
    // tab[n - 1][n - 1] = 3;

    for (int i = 1; i <= n; ++i) {
        tab[i][i - 1] = 2;
        tab[i][i] = 2;
        tab[i][i + 1] = 2;
    }
    tab[1][1] = tab[n][n] = 3;

    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            cout << tab[i][j];
        }
        cout << '\n';
    }
    cout << '\n';

    for (int t = -1; t < 2; t += 2) {
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < n; ++j) {
                if (i == j || (i + t == j)) {
                    cout << 1;
                } else {
                    cout << 0;
                }
            }
            cout << '\n';
        }

        cout << '\n';
    }


    return 0;
}