#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

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


int N;
vector<int>curr;

void back(int last) {   // last = ultima valoare din curr
    // afisam daca avem elemente in curr
    if (!curr.empty()) {
        for (int i = 0; i < curr.size(); i++)
            out << curr[i] << " ";
        out << "\n";
        // return; nu ne oprim
    }

    for (int i = last + 1; i <= N; i++) {
        curr.push_back(i);
        back(i);
        curr.pop_back();
    }
}


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    ios::sync_with_stdio(false);
    in >> N;

    back(0);    // Primul element din curr va fi 0 + 1

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