#include <iostream>
#include <fstream>

using namespace std;

const int NMAX = 9;

int st[NMAX], seen[NMAX], n;

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

void print_sol() {
    for (int i = 1; i <= n; i++) {
        fout << st[i] << " ";
    }
    fout << "\n";
}

void back(int k) {
    if (k == n + 1) {
        print_sol();

        return;
    } 

    for (int i = 1; i <= n; i++) { 
        if (seen[i] == 0) {
            seen[i] = 1; 
            st[k] = i; 

            back(k + 1);

            seen[i] = 0;
        }
    }
}
 
int main() {
    fin >> n;

    back(1);

    return 0;
}