#include <bits/stdc++.h>
using namespace std;

int n;
int v[10];
bool f[10];
inline void back(int k){
    if(k == n){
        for(int i = 0; i < n ; ++i)
            printf("%d ", v[i]);
        printf("\n");
        return ;
    }
    for(int i = 1; i <= n ; ++i){
        if(f[i]) continue ;
        v[k] = i;
        f[i] = 1;
        back(k + 1);
        f[i] = 0;
    }

}
int main()
{
    freopen("permutari.in", "r", stdin);
    freopen("permutari.out", "w", stdout);
    scanf("%d", &n);
    back(0);
    return 0;
}