#include <iostream>
#include <fstream>

using namespace std;

int n,sol[9];

ifstream in("permutari.in");
    ofstream out("permutari.out");

int valid(int k){
    for(int i=1;i<k;i++)
        if(sol[i] == sol[k])
            return 0;
    return 1;
}

void back(int k){

    if(k == n+1){
        for(int i=1;i<=n;i++)
            out<<sol[i]<<" ";
        out<<"\n";
    }
    else{
        sol[k]=0;
        while(sol[k]<n){
            sol[k]++;
            if(valid(k))
                back(k+1);
        }

    }

}

int main()
{
    

    in>>n;
    back(1);






    in.close();
    out.close();
    return 0;
}