#include <bits/stdc++.h>

using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
const int nMax = 10;
int St[nMax], viz[nMax];
inline void Back(int top, int n) {
    if(top == n + 1) {
        for(int i = 1; i <= n; i++) {
            g << St[i] << " ";
        }
        g << "\n";
    }
    else {
        for(int i = 1; i <= n; i++) {
            if(!viz[i]) {
                viz[i] = 1;
                St[top] = i;
                Back(top + 1, n);
                viz[i] = 0;
            }
        }
    }
}
int main()
{
    int n;
    f >> n;
    Back(1, n);
    return 0;
}