#include <fstream>

using namespace std;

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

int k, n, maxx, c[17];

void out(){
    for (int i = 1; i <= k; i++)
        fout << c[i] << ' ';
    fout << '\n';
}

void BKT(int m){
    if (m == k + 1)
        out();
    for (int i = c[m - 1] + 1; i <= n; i++){
        c[m] = i;
        BKT(m + 1);
    }
}
int main()
{
    fin >> n;
    //USING BIT MASKS
    maxx = (1 << n) - 1;
    for (int mask = 1; mask <= maxx; mask++){
        for (int i = 0; i < n; i++)
            if (mask & (1 << i))
                fout << i + 1 << ' ';
        fout << '\n';
    }
    //USING COMBINATIONS
    /*
    for (k = 1; k <= n; k++)
        BKT(1);
    */
    return 0;
}