#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n, f;
int v[10];
int main() {
    fin >> n;
    for (int i = 1; i <= n; ++i) {
        fout << i << ' ';
        v[i] = i;
    }
    fout << '\n';
    f = 1;
    for (int i = 1; i <= n; ++i) {
        f *= i;
    }
    for (int i = 1; i < f; ++i) {
        next_permutation(v + 1, v + n + 1);
        for (int j = 1; j <= n; ++j) {
            fout << v[j] << ' ';
        }
        fout << '\n';
    }
    fout.close();
    return 0;
}