#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <set>
#include <stack>
#include <algorithm>
using namespace std;

int no;
int solution[10];
int visited[10];

void perm(int k){
    if(k == no+1){
        for(int i = 1; i <= no; ++i)
            printf ("%d " ,solution[i]);
        printf("\n");
    }
    
    for(int i = 1; i <= no; ++i){
        if(!visited[i]){
            visited[i] = 1;
            solution[k] = i;
            perm(k+1);
            visited[i] = 0;
        }
    }
}

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