#include <bits/stdc++.h>
using namespace std;

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

int n, p[101];

bool exists(int element, int len) {
    for (int i = 0; i < len; ++i) {
        if (p[i] == element) {
            return true;
        }
    }
    return false;
}

void perm(int len){
    if (len == n){
        for (int i = 0; i < n; ++i) {
            fout << p[i] << " ";
        }
        fout << "\n";
        return;
    }
    for (int i = 1; i <= n; ++i) {
        if (!exists(i, len)) {
            p[len] = i;
            perm(len + 1);
        }
    }
}

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