#include <bits/stdc++.h>
using namespace std;
ifstream f ("permutari.in");
ofstream g ("permutari.out");
int main()
{
    int n;
    f >> n;
    int v[10];
    for(int i = 0; i < n; ++i)
    {
        v[i] = i + 1;
    }
    sort(v, v + n);
    do
    {
        for(int i = 0; i < n; ++i)
        {
            g << v[i] << ' ';
        }
        g << '\n';
    }while(next_permutation(v, v + n));
    return 0;
}