#include <fstream>
#include <algorithm>

using namespace std;

int main()
{
    ifstream f("permutari.in");
    ofstream g("permutari.out");
    int n,a[9],i,j,nr=0,p=1;
    f>>n;
    for (i=1; i<=n; i++)
    {a[i] = i;p*=i;}
    while(nr<p)
    {
        nr++;
        for(i=1; i<=n; i++)
        g<<a[i]<<" ";
        i=n;
        while (a[i-1] > a[i]) i--;
        i--;
        j=i+1;
        while (j <= n && a[j] > a[i]) j++;
        swap(a[i],a[j-1]);
        sort(a+i+1,a+n+1); // sortez secventa a[i+1..n] [i+1,n+1)
        g<<'\n';
    }
    f.close(); g.close();
}