#include <fstream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<string>
#include<unordered_map>
#include<map>
#include<climits>
using namespace std;
ifstream cin("permutari.in");
ofstream cout("permutari.out");
int v[10];
int n;
int permurm(){
 int j,t;
 for(int i=n-2;i>=0;i--){
    if(v[i]<v[i+1]){
        for(j=n-1;j>i;j--){
            if(v[j]>v[i])break;
        }
        swap(v[i],v[j]);
        reverse(v+i+1,v+n);
        return 1;
    }
 }
  return 0;
}
int main()
{
    cin>>n;
    for(int i=0;i<n;i++)v[i]=i+1;
    do{
        for(int i=0;i<n;i++)cout<<v[i]<<" ";
        cout<<'\n';
    }
    while(permurm());
    return 0;
}