#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;

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

int n;
vector<int> v;

int main()
{
    in>>n;
    for (int i=1; i<=n; ++i)
     v.push_back(i);

    for (int i = 0; i < n; ++i)
     out<<v[i]<<" ";
     out<<'\n';

    while ( next_permutation(v.begin(), v.end()))
     {
         for (int i = 0; i < n; ++i)
          out<<v[i]<<" ";

         out<<'\n';
     }

return 0;
}