#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;

#define INFILE "permutari.in"
#define OUTFILE "permutari.out"
#define VMAX 9

ifstream fin (INFILE);
ofstream fout (OUTFILE);

short n;
vector<short> v;

void solve(){

    fin >> n;

    for(int i = 1; i <= n; ++i){
        v.push_back(i);
    }

    do{
        for(int i = 0; i < v.size(); ++i){
            fout << v[i] << " ";
        }
        fout << '\n';
    }while(next_permutation(v.begin(), v.end()));

}

int main(){
    solve();
    return 0;
}