#include <cstdio>
using namespace std;
#define NMAX 10000
int n, v[23], u[23];

void Back(int k){

    int i;
    for(i=1; i<=n; i++){
        if(!u[i]){
            u[i] = 1;
            v[k] = i;
            if(k == n){
                for(int x = 1; x <= n; x++){
                    printf("%d ", v[x]);
                }
                printf("\n");
            }
            else Back(k + 1);


            u[i] = 0;
        }
    }

}

int main(){


    freopen("permutari.in", "r", stdin);
    freopen("parmutari.out", "w", stdout);

    scanf("%d", &n);

    Back(1);

    return 0;
}