#include <cstdio>
#include <algorithm>

using namespace std;
int n,a[100];
int main()
{
    freopen("permutari.in","r",stdin);
    freopen("permutari.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        a[i]=i;
    }
    printf("\n");
    sort(a,a+n);
    do
    {
        for(int i=1;i<=n;i++)
            printf("%d ",a[i]);
        printf("\n");
    }
    while(next_permutation(a+1,a+n+1));
    return 0;
}