#include <fstream>

using namespace std;

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

int n, viz[10], a[10];

void back(int k) {
    if (k == n + 1) {
        for (int i = 1; i <= n; ++i){
            fout << a[i] << ' ';
        }
        fout << "\n";
        return;
    }
    for (int i = 1; i <= n; ++i) {
        if (viz[i] == 0){
            a[k] = i;
            viz[i] = 1;
            back(k + 1);
            viz[i] = 0;
        }
    }
}

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