#include <bits/stdc++.h>
#define N_MAX 10

using namespace std;

ifstream fin("permutari.in");
ofstream fout("permutari.out");

int N, used[N_MAX], arr[N_MAX];

void bk(int p)
{
    if (p == N + 1)
    {
        for (int i = 1; i <= N; i++)
            fout << arr[i] << " ";
        fout << "\n";
        return;
    }
    for (int i = 1; i <= N; i++)
        if (used[i] == 0)
        {
            used[i] = 1;
            arr[p] = i;
            bk(p + 1);
            used[i] = 0;
        }
}

int main()
{
    fin >> N;
    bk(1);
    return 0;
}