#include <fstream>
#include <algorithm>

using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n,i,p[10],mai_am();
int main()
{
    f>>n;
    for(i=1;i<=n;i++)
        p[i]=i;
    for(;;)
    {
        for(i=1;i<=n;i++)
            g<<p[i]<<' ';
        g<<'\n';
        if(mai_am())
            continue;
        break;
    }
    return 0;
}
int mai_am()
{
    int L,R;
    for(i=n;i>=0;i--)
        if(p[i]>p[i-1])
            break;
    if(i==1)return 0;
    for(L=i,R=n;L<R;L++,R--)
    {
        int aux=p[L];p[L]=p[R];p[R]=aux;
    }

    for(L=i-1,R=i;;R++)
        if(p[R]>p[L])
        {
            int aux=p[L];p[L]=p[R];p[R]=aux;
            return 1;
        }

}