#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream cin("permutari.in");
ofstream cout("permutari.out");

void next_perm(vector <int>& a){
    for(int k=0; k<a.size(); k++){
        cout << a[k] << " ";
    }
    cout << '\n';
    int x=a.size();
    int i=x-2;
    while(i>=0 && a[i]>=a[i+1]){
        i--;
    }
    if(i<0){
        return;
    }
    if(i>=0){
        int j=x-1;
        while(a[j]<=a[i]){
            j--;
        }
        swap(a[i],a[j]);
    }
    reverse(a.begin()+1+i,a.end());
    next_perm(a);
}

int main()
{
    int n;
    cin >> n;
    vector <int> v(n);
    for(int i=0; i<n; i++){
        v[i]=i+1;
    }
    next_perm(v);
}