#include <fstream>

using namespace std;

int N, u[10], p[10];

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

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

int main()
{
    f >> N;
    for (int i = 0; i < 10; i++)
        u[i] = 0;
    dfs(0);

    return 0;
}