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

using namespace std;

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

int n, i;
vector <int> v;

void afisare()
{
    int n=v.size();
    for (int i=0; i<n; ++i) g<<v[i]<<" ";
    g<<'\n';
}

int main()
{
    f>>n;

    for (i=1; i<=n; ++i)
    v.push_back(i);

    afisare();
    while (next_permutation(v.begin(),v.end()))
        afisare();



    return 0;
}