#include<cstdio>
#include<algorithm>
using namespace std;

#define _count_of(a) sizeof(a)/sizeof(a[0])

int v[9] = {0};

int main()
{
    freopen("permutari.in","r", stdin);
    freopen("permutari.out", "w", stdout);
    short n;
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i)
        v[i - 1] = i;
    do
    {
        for(int i  = 0; i < n; ++i)
            printf("%d ",v[i]);
        printf("\n");
    }
    while(next_permutation(v, v + n));

    return 0;
}