#include <iostream>
#include <fstream>

using namespace std;

int s[10],n,x[10];

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

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

    scanf("%d",&n);

    back(1);
    return 0;
}