#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

vector<int> v;

int i,n;

ifstream f ("permutari.in");
ofstream g ("permutari.out");
void perm()
{
    for (i = 1; i <= n; ++i)
        v.push_back(i);
    do {
        for (i = 0; i < n; ++i)
            g << v[i] << ' ';
        g << '\n';
    } while (next_permutation(v.begin(), v.end()));
}
int main()
{
    f >> n;
    perm();
    return 0;
}