#include <iostream>
#include <algorithm>
using namespace std;

int v[9];
ifstream fin("permutari.in");
ofstream fout("permutari.out");

int main()
{
    int n;
    fin>>n;
    int su=1;
    for(int k=2;k<=n;k++)
        su*=k;
    for(int k=1;k<=n;k++)
        v[k]=k;
    for(int k=1;k<=su;k++)
    {
        for(int c=1;c<=n;c++)
            fout<<v[c]<<" ";
        fout<<'\n';
        next_permutation(v+1,v+1+n);
    }
    return 0;
}