#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define pii pair<int, int>
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
const int mod = 1e9 + 7, N = 53, M = 200000;

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    int n;
    cin >> n;
    vector <vector <int>> a(n, vector <int> (n));
    vector <vector <int>> b(n, vector <int> (n));
    vector <vector <int>> c(n, vector <int> (n));
    for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) {
        int d = abs(i - j);
        if (d <= 1) {
            a[i][j] = 2;
        }
        if (d == 2) {
            a[i][j] = 1;
        }
    }
    a[0][0] = a[n - 1][n - 1] = 3;
    b[0][0] = c[0][0] = 1;
    for (int i = 1; i < n; ++i) {
        if (i & 1) {
            b[i - 1][i] = b[i][i] = 1;
            c[i][i - 1] = c[i][i] = 1;
        } else {
            b[i][i - 1] = b[i][i] = 1;
            c[i - 1][i] = c[i][i] = 1;
        }
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            cout << a[i][j] << " \n"[j == n - 1];
        }
    }
    cout << '\n';
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            cout << b[i][j] << " \n"[j == n - 1];
        }
    }
    cout << '\n';
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            cout << c[i][j] << " \n"[j == n - 1];
        }
    }
}