#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using treap = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define REP(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) begin(obj), end(obj)
#define RALL(obj) rbegin(obj), rend(obj)
#define fi first
#define se second
using ii = pair<int, int>;
vector<ii> dirs = {
    {1, 0}, {0, 1}, {-1, 0}, {0, -1},  // 4方向
    {1, 1}, {-1, 1}, {-1, -1}, {1, -1},  // 斜め
    {0, 0},  // 自身
};
template <class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }
template <class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <class T, class S> vector<T> make_vec(size_t n, S x) { return vector<T>(n, x); }
template <class T, class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec<T>(ts...))>(n, make_vec<T>(ts...)); }

// debug
template <class T> ostream& operator<<(ostream& s, vector<T>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : " "); return s; }
template <class T> ostream& operator<<(ostream& s, vector<vector<T>>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : "\n"); return s; }
template <class T, class S> ostream& operator<<(ostream& s, pair<T, S>& p) { s << "{" << p.first << ", " << p.second << "}"; return s; }
template <class T, class S> ostream& operator<<(ostream& s, map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
template <class T, class S> ostream& operator<<(ostream& s, unordered_map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
#ifdef _MY_DEBUG
    #define dump(...) cerr << "/* " << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << endl, dump_func(__VA_ARGS__), cerr << "*/\n\n";
#else
    #define dump(...)
    #define endl "\n"
#endif
void dump_func() { cerr << endl; }
template <class Head, class... Tail> void dump_func(Head&& h, Tail&&... t) { cerr << h << (sizeof...(Tail) == 0 ? "" : ", "), dump_func(forward<Tail>(t)...); }

struct Fast { Fast() { cin.tie(0); ios::sync_with_stdio(false); } } fast;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
constexpr int MOD = 1000000007;
// *************** TEMPLATE END *************** 

signed main() {
    int n; cin >> n;
    auto g = make_vec<int>(n, n, 0);
    function<void(int, int, int)> rec = [&](int l, int r, int c) {
        if (r - l <= 2) {
            REPI (i, l, r) {
                REPI (j, l, r) {
                    g[i][j] = g[j][i] = c;
                }
            }
            return;
        }
        int m = (l + r) / 2;
        REPI (i, l, m) {
            REPI (j, m, r) {
                g[i][j] = g[j][i] = c;
            }
        }
        rec(l, m, c + 1);
        rec(m, r, c + 1);
    };
    rec(0, n, 1);
    REP (i, n) {
        REPI (j, i + 1, n) {
            cout << g[i][j] << " ";
        }
        cout << endl;
    }
    // dump(g);
    // if (n == 2) {
    //     cout << 1 << endl;
    // } else if (n == 3) {
    //     cout << "1 2" << endl;
    //     cout << "1" << endl;
    // } else if (n == 4) {
    //     cout << "1 2 1" << endl;
    //     cout << "1 2" << endl;
    //     cout << "2" << endl;
    // } else {
    //     REP (i, n) {
    //         REPI (j, i + 1, n) {
    //             if (i == 0 && j == 1) {
    //                 cout << 3;
    //             } else if (i == 0) {
    //                 cout << 2;
    //             } else if (j == 1) {
    //                 cout << 1;
    //             } else {
    //                 cout << 3;
    //             }
    //         }
    //     }
    // }
}


Measured memory_bytes: 2432