#include <fstream>
#include <stack>

using namespace std;

ifstream fin("date.in");
ofstream fout("date.out");
#define N 20
int top;
int st[N];
int n ;

void backt( int k )
{
    if( k == n + 1 )
    {
        if( top != 0 )
        {
            for( int i = 1 ; i<= top ; ++i )
                fout<<st[i] << ' ';
            fout << '\n';
        }
    }
    else
    {
        ///nu alegem elementul
        backt( k + 1 );
        /// alegem elementul
        st[ ++top ] = k ;
        backt( k+1 );
        --top;
    }
}

int main()
{
    fin>>n;
    backt(1);
    return 0;
}