#include <stdio.h>
#include <algorithm>
FILE *fin, *fout;
int n, *a;
int main()
{
    fin = fopen("permutari.in", "r");
    fout = fopen("permutari.out", "w");
    fscanf(fin, "%d", &n);
    a = new int[n];
    for(int i =0; i< n; i++) a[i] = i+1;
    while(1)
    {
            for(int i =0; i< n; i++)
            {
                    fprintf(fout, "%d ", a[i]);
            }
            fprintf(fout, "\n");
            if(!std::next_permutation(a, a+n)) break;
    }
    fclose(fin);
    fclose(fout);
    return 0;
}