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

using namespace std;

#define MAXN 10

ifstream f("permutari.in");
ofstream g("permutari.out");

int a[MAXN], n;

void print()
{
    for (int i = 1; i <= n; i++) {
        g << a[i] << ' ';
    }
    g << '\n';
}

void init() {
    for (int i = 1; i <= n; i++) {
        a[i] = i;
    }
}

int main()
{
    f >> n;
    init();

    do {
        print();
    } while (next_permutation(a + 1, a + n + 1));

    return 0;
}