#include <bits/stdc++.h>

using namespace std;

const int len = 2 << 9;
int arr[len], n;

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

bool check(int step) {
    for (int i = 1; i < step; i++)
        if (arr[i] == arr[step])
            return false;
    return true;
}

void bt(int step) {
    if (step == n + 1) {
        for (int i = 1; i <= n; i++)
            fout << arr[i] << " ";
        fout << "\n";
    }
    else {
        for (int i = 1; i <= n; i++) {
            arr[step] = i;
            if (check(step))
                bt(step + 1);
        }
    }
}

int main() {
    fin >> n;
    bt(1);
}