#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

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

int n;
vector<int> v;
vector<bool> folosit;

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

    for (int i = 1; i <= n; ++i) {
        if (!folosit[i]) {
            v[k] = i;
            folosit[i] = true;
            back(k + 1);
            folosit[i] = false;
        }
    }
}

int main() {
    fin >> n;
    v.resize(n);
    folosit.resize(n + 1, false); // indexăm de la 1 la n
    back(0);
    return 0;
}