#include <iostream>
#include <fstream>
#include <queue>
#include <algorithm>

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

typedef long long ll;
const ll NMax = 10;

// varianta folosind functia next_permutation din libraria algorithm

int N;
int v[NMax];

int main() {
    in>>N;

    for (int i=1;i<=N;++i) {
        v[i] = i;
    }

    do {
        for (int i=1;i<=N;++i) {
             out<<v[i]<<' ';
        }
        out<<'\n';
    } while (next_permutation(v+1,v+N+1));


    return 0;
}