#include <bits/stdc++.h>

using namespace std;

ifstream fin ("submultimi.in");
ofstream fout ("submultimi.out");

typedef long long ll;
int n, st[18], top;

void Back (int top, int k){
    if (top > k){
        for (int i = 1; i <= k; i++)
            fout << st[i] << " ";
        fout << "\n";
        return;
    }
    for (int i = st[top - 1] + 1; i <= n - k + top; i++){
        st[top] = i;
        Back(top + 1, k);
    }
}

void Solve (){
    fin >> n;
    for (int i = 1; i <= n; i++)
        Back(1, i);
}

int main(){
    Solve();
    return 0;
}