#include <bits/stdc++.h>

using namespace std;

ifstream fin ("permutari.in");
ofstream fout ("permutari.out");

int n;
int v[10];
int f[10];

int backtracking ( int step )
{
    if ( step <= n )
    {
        for ( int i = 1; i <= n; ++i )
        {
            if ( f[i] == 0 )
            {
                f[i] = 1;
                v[step] = i;
                backtracking(step+1);
                f[i] = 0;
            }
        }
    }
    else
    {
        for ( int i = 1; i <= n; ++i )
            fout<<v[i]<<" ";
        fout<<'\n';
    }
}

int main()
{
    fin>>n;
    backtracking(1);
}