#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream fi ("submultimi.in");
ofstream fo ("submultimi.out");
inline void comb(int n,int k)
{
    vector<bool>p(n);
    fill(p.begin()+k,p.end(),1);
    do
    {
        for(int i=0;i<n;++i)
            if(!p[i])
                fo << i+1<<" ";
        fo<<'\n';

    }while(next_permutation(p.begin(),p.end()));
}
int main()
{
    int N;
    fi >> N;
    fi.close();
    for(int k = 1; k <= N; ++k)
        comb(N,k);
    fo.close();
    return 0;
}