#include <fstream>
using namespace std;

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

int st[10], n;
void afisare ()
{
    for (int i = 1; i <= n; ++i)
        g << st[i] << " ";
    g << endl;
}
bool valid (int niv)
{
    for (int i = 1; i < niv; ++i)
        if (st[niv] == st[i])
          return false;
    return true;
}
void backt (int niv)
{
    for (int i = 1; i <= n; ++i)
    {
        st[niv] = i;
        if (valid (niv))
        {
            if (niv == n) afisare();
            else backt (niv + 1);
        }
    }
}
int main()
{
    f >> n;
    backt(1);
    return 0;
}