#include <fstream>

using namespace std;
int N;
int d[10];

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

void dfs(int k)
{
    if (k == N) {
        for (int i = 0; i < N; i++)
            g << d[i] << ' ';
        g << '\n';
        return;
    } else {
        for (int i = k; i < N; i++) {
            int tmp = d[k];
            d[k] = d[i];
            d[i] = tmp;
            dfs(k+1);
            tmp = d[k];
            d[k] = d[i];
            d[i] = tmp;
        }
    }
}

int main()
{

    f >> N;
    for (int i = 0; i < N; i++) d[i] = i+1;
    dfs(0);

    return 0;
}