#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int main()
{
     int N;
   int v[8];
    f >> N;
    for (int i = 1; i <= N; ++i)
      v[i-1] = i;
    do {
        for (int i = 0; i < N; ++i)
            g << v[i] << ' ';
        g << '\n';
    } while (next_permutation(v, v + N));
    return 0;
}