#include<stdio.h>
int a[10],n;
int check (int k,int y)
{
    int j;
    for(j=1;j<k;++j)
    if(a[j]==y)
    return 0;
    return 1;
}
void back (int k)
{
    int i;
    if(k==n+1)
    {
        for(i=1;i<=n;++i)
        printf("%d ",a[i]);
        printf("\n");
    }
    else
    {
        for(i=1;i<=n;++i)
        if(check(k,i)==1)
        {
            a[k]=i;
            back(k+1);
        }
    }
}
int main ()
{
    freopen("permutari.in","r",stdin);
    freopen("permutari.out","w",stdout);
    scanf("%d",&n);
    back(1);
    return 0;
}