#include <bits/stdc++.h>

using namespace std;

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

const int DIM = 10 + 5;

int n, ans[DIM], f[DIM];

void solve(int k)
{
    for(int i = 1; i <= n; ++i) {
        if(f[i] == false) {
            f[i] = true;
            ans[k] = i;
            if(k < n) solve(k + 1);
            else {
                for(int i = 1; i <= n; ++i) fout << ans[i] << " ";
                fout << "\n";
            }
            f[i] = false;
        }
    }
}

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