#include <fstream>

using namespace std;

int x[20], n, f[20];

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

int cont(int pas) {
    for (int i=1;i<pas;i++)
        if (x[i] == x[pas])
            return 0;
    return 1;
}

void back(int pas) {

    if (pas > n) {
        for (int i=1;i<=n;i++)
            fout<<x[i]<<" ";
        fout<<"\n";
        return;
    }

    for (int i=1;i<=n;i++) {
        if (f[i] == 0) {
            x[pas] = i;
            f[i] = 1;
            back(pas+1);
            f[i] = 0;
        }
    }
}

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