#include <iostream>
#include <deque>
#include <vector>
#include <cstring>
#include <bitset>
#include <algorithm>
using namespace std;

int i, N, A[10];

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