#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream F("permutari.in");
ofstream g("permutari.out");
 int a[10], n,f=1;
int main()
{
    F>>n;
    for(int i=1; i<=n;i++){

    a[i]=i; f*=i;}

    for(int q=1; q<=f;q++){
        for(int j=1;j<=n;j++)
            g<<a[j]<<" ";
            g<<"\n";
        next_permutation(a+1,a+n+1);
    }
 return 0;
}