#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define MAX_N 200005

int main() {
    int n;
    cin >> n;
    int a[n][n];
    rep(i, n) rep(j, n) a[i][j] = 0;
    rep(i, n) {
        rep(j, n) {
            if (j >= i) a[i][j] = 2;
            if (j == i && i < n / 2) a[i][j] = 1;
        }
    }
    rep(i, n) {
        rep(j, n) cout << a[i][j];
        cout << endl;
    }
    return 0;
}