#include <bits/stdc++.h>

using namespace std;
ifstream in  ("permutari.in");
ofstream out("permutari.out");

int n;

#define maxN 8

int v[maxN+1];
bool vc[maxN+1];

void bkt(int pos){
    if(pos==n+1){
        for(int i=1;i<=n;i++){
            out<<v[i]<<" ";
        }
        out<<'\n';
    }
    else{
        for(int i=1;i<=n;i++){
            if(vc[i]==0){
                v[pos]=i;
                vc[i]=1;
                bkt(pos+1);
                vc[i]=0;
            }
        }
    }
}

int main(){
    in>>n;
    bkt(1);
}