#include <cstdio>

using namespace std;

int v[10],n,i,j;
int viz[10];

void bkt (int p)
{
    if (p==n+1)
    {
        for (i=1; i<=n; i++)
        {
            printf ("%d ",v[i]);
        }
        printf ("\n");
    }
    else
    {
        for (i=1; i<=n; i++)
        {
            if (viz[i]==0)
            {
                v[p]=i;
                viz[i]=1;
                bkt(p+1);
                viz[i]=0;
            }
        }
    }
}

int main()
{
    freopen ("permutari.in","r",stdin);
    freopen ("permutari.out","w",stdout);

    scanf ("%d",&n);

    bkt(1);

    return 0;
}