#include <bits/stdc++.h>
using namespace std;
const int N = 110;
int a[N], al, n;

void dfs(int u) {
    if (u == n + 1) return;

    a[++al] = u;
    // 立即输出
    for (int i = 1; i <= al; i++) cout << a[i] << " ";
    cout << endl;
    dfs(u + 1);
    al--;

    dfs(u + 1);
}

int main() {
    cin >> n;
    dfs(1);
    return 0;
}