#include <fstream>
#include <algorithm>
#define Nmax 20

using namespace std;

string file="permutari";

ifstream f( (file + ".in").c_str() );
ofstream g( (file + ".out").c_str() );

int uz[Nmax], v[Nmax], w[Nmax];
int n, k, fact=1;

void print()
{
    for ( int i = 1; i <= n; i ++ )
    {
        g << v[i] << " ";

    }
    g << '\n';
}

int main()
{
    f >> n;
    for ( int i = 1; i <= n; i ++ )
    v[i]=i;
    do{
     print();
     }while(next_permutation(v+1, v+n+1) == true);
    {

    }
//g << 12;
    //bkt(1);
    return 0;
}