#include <iostream>
#include <fstream>
#include <unordered_map>
#include <queue>
#include <stack>
#include <vector>

#define ll long long
#define ull unsigned long long
#define pb push_back
using namespace std;
ifstream in("submultimi.in");
ofstream out("submultimi.out");

const int NMax = 2e2 + 5;
const int inf = 1e9 + 5;

int N;
int nrSub[NMax],v[NMax];

void solve(int);

int main() {
    in>>N;
    //cout<<N<<'\n';

    for (int i=1;i <= N;++i) {
        nrSub[i] = 1<<(N-i);
    }

    int lim = 1<<(N);
    for (int i=1;i < lim;++i) {
        solve(i);
    }

    in.close();out.close();
    return 0;
}

void solve(int nr) {

    int idx = 1, val = 1,cr = 0;
    while (cr < nr) {
        int low = cr + 1, high = cr + nrSub[val];
        if (nr > high) {
            cr += nrSub[val];
            ++val;
        }
        else {
            v[idx++] = val;
            ++val;
            ++cr;
        }
    }

    for (int i=1;i < idx;++i) {
        out<<v[i]<<' ';
    }
    out<<'\n';
}