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

using namespace std;

ifstream f("permutari.in");
ofstream g("permutari.out");

int n;
vector<int> v;

int main()
{
    f >> n;
    v.resize(n);
    for (int i=0;i<n;i++) v[i]=i+1;

    do {
        for (int x:v)
            g << x << ' ';
        g << '\n';
    } while (next_permutation(v.begin(), v.end()));
    return 0;
}