#include<cstdio>
#include<algorithm>
using namespace std;
int a[10],n,i,f=1;
void read(),solve();
int main()
{
    read();
    solve();
    return 0;
}
void read()
{
    freopen("permutari.in","r",stdin);
    freopen("permutari.out","w",stdout);
    scanf("%d ",&n);
    for(i=1;i<=n;i++)
    {
        f*=i;
        a[i-1]=i;
    }
}
void solve()
{
    for(;f;f--)
    {
        for(i=0;i<n;i++) printf("%d ",a[i]);
        printf("\n");
        next_permutation(a,a+n);
    }
}