#include <bits/stdc++.h>

using namespace std;

int N;
vector<int> subset;

void search(int k)
{
    if (k == N)
    {
        for (auto val : subset)
            cout << val << " ";
        cout << "\n";
    }
    else 
    {
        search(k + 1);
        subset.push_back(k);
        search(k + 1);
        subset.pop_back();
    }
}

int main()
{
    cin >> N;

    search(0);

    return 0;
}