#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;

int s[10],n;
int v[10];
void show()
{
    for(int i=1;i<=n;i++)
        printf("%d ",s[i]);
    printf("\n");
}
void bt(int k)
{
    if(k==n+1)
    {show();
        return;}
    for(int i=1;i<=n;i++)
        if(v[i]==0)
        {
            s[k]=i;
            v[i]=1;
            bt(k+1);
            v[i]=0;
        }
}
int main()
{
    freopen("permutari.in","r",stdin);
    freopen("permutari.out","w",stdout);
    scanf("%d ",&n);
    bt(1);
    return 0;
}