#include <vector>
#include <fstream>
#include <bitset>
#include <queue>
using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n, k;
int fr[20];
int st[20];
void afis(int top)
{
    for (int i = 1; i <= top; i++)
        fout << st[i] << " ";
    fout << "\n";
}
void back(int top)
{
    for(int i=st[top-1]+1; i<=n; i++)
        if(!fr[i])
        {
            fr[i] = 1;
            st[top] = i;
            afis(top);
            if(top<n)
                back(top + 1);
            fr[i] = 0;
        }
}
int main()
{
    fin >> n;
    back(1);
    return 0;
}