#include <stdio.h>
int n,u[9],v[9];
void solve(int k)
{
    int i;
    if(k == n + 1)
    {
        for(i = 1; i <= n; i++)
            printf("%d ", v[i]);
        printf("\n");
        return;
    }
    for(i = 1; i <= n; i++)
        if(!u[i])
        {
            u[i] = 1;
            v[k] = i;
            solve(k+1);
            u[i] = 0;
        }
}
int main()
{
    freopen("permutari.in","r",stdin);
    freopen("permutari.out","w",stdout);
    scanf("%d",&n);
    solve(1);
    return 0;
}