#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    int N;
    cin >> N;
    vector<vector<int>> ans(N, vector<int>(N));
    for (int i=0; i<N; i++){
        for (int j=0; j<i; j++) ans[i][j] = 2;
    }

    for (int i=0; i<N/2; i++) ans[i][i] = 1;
    for (int i=N/2; i<N; i++) ans[i][i] = 2;

    for (int i=0; i<N; i++){
        for (int j=0; j<N; j++) cout << ans[i][j];
        cout << endl;
    }

    return 0;
}