#include <fstream>
#include <algorithm>

using namespace std;

int a[10];

int main()
{
    int n, i, p;
    ifstream fin("permutari.in");
    fin >> n;
    fin.close();
    ofstream fout("permutari.out");
    for(i = 1; i<= n; i++) a[i] = i;
    while(a[0] == 0)
    {
        for(i = 1; i <= n; i++) fout << a[i] << " ";
        fout << "\n";
        for(i = n; a[i] < a[i - 1]; i--);
        p = i - 1;
        for(i = p + 1; i <= n && a[p] < a[i]; i++);
        swap(a[p], a[i - 1]);
        sort(a + p + 1, a + n + 1);
    }
    fout.close();
    return 0;
}