#pragma GCC optimize ("O3,inline,omit-frame-pointer,no-asynchronous-unwind-tables,fast-math")
#include <bits/stdc++.h>
#include <unordered_map>
#include <stdlib.h>
using namespace std;
#define rep(i, a, n) for(ll i = a; i < n; i++)
#define rrep(i, a, n) for(ll i = a; i >= n; i--)
#define inr(l, x, r) (l <= x && x < r)
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(x) (x).begin(), (x).end()
//constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;
constexpr int IINF = 1001001001;
constexpr ll INF = 1LL<<60;
template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

int main() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    ll n; cin >> n;
    rep(i,1,n+1){
        rep(j,0,i){
            if(i%2){
                ll mid = i/2;
                if(abs(mid-j)%3 == 0) cout << "2 ";
                else cout << "1 "; 
            }else{
                if(j < i/2){
                    if(abs(i/2-j)%3 == 2) cout << "2 ";
                    else cout << "1 "; 
                }else{
                    if(abs(i/2-j)%3 == 1) cout << "2 ";
                    else cout << "1 "; 
                }
            }
        }
        cout << endl;
    }

    return 0;
}