#include <iostream>
#include <fstream>

using namespace std;
ifstream fin ("permutari.in");
ofstream fout ("permutari.out");
int p[10], viz[10], n;

void back(int k)
{
   if (k == n){
    for(int i = 1; i <= n; ++i)
        fout << p[i] << ' ';
    fout << endl;
   }
    else{
        for(int i = 1; i <= n; ++i)
        {
            if (viz[i] == 0)
            {
                p[k+1] = i;
                viz[i] = 1;
                back(k+1);
                viz[i] = 0;
            }
        }
    }

}

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