#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>

using namespace std;

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

const int maxn = 10;

int st[maxn], n;
bitset <maxn> used;

inline void Back(int k) {
    if(k == n + 1) {
        for(int i = 1 ; i <= n ; ++ i)
            fout << st[i] << ' ';
        fout << '\n';
        return;
    }
    for(int i = 1 ; i <= n ; ++ i)
        if(!used[i]) {
            used[i] = 1;
            st[k] = i;
            Back(k + 1);
            used[i] = 0;
        }
}

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