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

ifstream fin ("permutari.in");
ofstream fout ("permutari.out");
int n;
int st[10], top, f[10];

void Write ()
{
    for (int i = 1; i <= n; i++)
        fout << st[i] << " ";
    fout << "\n";
}

void Back (int top)
{
    if (top > n)
    {
        Write();
        return;
    }
    for (int i = 1; i <= n; i++)
        if (!f[i])
        {
            f[i] = 1;
            st[top] = i;
            Back(top + 1);
            f[i] = 0;
        }
}
int main()
{
    fin >> n;
    Back(1);
    return 0;
}