#include <stdio.h>

int n, a[10];
bool b[10];

void back(int k, int len)
{
    if(k-1==len)
    {
        for(int i=1;i<=n;i++)
            printf("%d ", a[i]);
        printf("\n");
    }
    else
    {
        for(int i=1;i<=len;i++)
        if(b[i]==0)
        {
            b[i]=1;
            a[k]=i;
            back(k+1,len);
            b[i]=0;
        }
    }
}

int main()
{
    freopen("permutari.in","r",stdin);
    freopen("permutari.out","w",stdout);
    scanf("%d", &n);
    back(1,n);
    return 0;
}