#include <bits/stdc++.h>
using namespace std;

using ll = long long;

void pg(vector<vector<int>> &g, int n) {
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cout << g[i][j] << ' ';
        }
        cout << '\n';
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n; cin >> n;

    vector<vector<int>> grid(n+2, vector<int>(n+2)), s1(n+2, vector<int>(n+2)), s2(n+2, vector<int>(n+2));
    for (int i = 0; i < n; i++) {
        s1[i][i] = s2[i][i] = 1;
        if (i == 0 || i == n-1) {
            grid[i][i] = 3;
        } else {
            grid[i][i] = 2;
            grid[i-1][i+1] = grid[i+1][i-1] = 1;
        }
        if (i == n-1) continue;

        grid[i+1][i] = grid[i][i+1] = 2;

        if (i % 2) {
            s1[i+1][i] = 1;
            s2[i][i+1] = 1;
        } else {
            s1[i][i+1] = 1;
            s2[i+1][i] = 1;
        }
    }

    pg(grid, n);
    cout << '\n';
    pg(s1, n);
    cout << '\n';
    pg(s2, n);
}