#include <bits/stdc++.h>

using namespace std;

ifstream f ("submultimi.in");
ofstream g ("submultimi.out");

vector<int> path;
int n;

void backtrack(int start) {
    if (path.size() <= n && !path.empty()) {
        for (int i = 0; i < path.size(); i++)
            g << path[i] << ' ';
        g << '\n';
        if (path.size() == n)
            return;
    }

    for (int i = start; i <= n; i++) {
            path.push_back(i);
            backtrack(i + 1);

            path.pop_back();
    }
}

int main() {
    f >> n;
    backtrack(1);
}