#include <iostream>
#include <fstream>
using namespace std;

int n, sol[10];
bool used[10];

ifstream fin("permutari.in");
ofstream fout("permutari.out");
void afis()
{
    for(int i = 1; i <= n; i++)
        fout << sol[i] << ' ';
    fout << '\n';
}

void bkt(int top)
{
    for(int i = 1; i <= n; i++)
    {
        if(used[i])
            continue;
        sol[top] = i;
        used[i] = 1;
        if(top == n)
            afis();
        else
            bkt(top + 1);
        used[i] = 0;
    }
}

int main()
{
    fin >> n;
    bkt(1);
    return 0;
}