#include <fstream>

using namespace std;

int n, i, v[10], f[10];

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

void back(int niv){
    if(niv > n){
        for(int i=1;i<=n;i++)
            fout<<v[i]<<" ";
        fout<<"\n";
        return;
    }
    for(int i = 1;i<=n;i++)
        if(f[i] == 0){
            f[i] = 1;
            v[niv] = i;
            back(niv+1);
            f[i] = 0;
        }
}

int main(){
    fin>>n;
    back(1);
    return 0;
}