#include <algorithm>
#include <stdio.h>
#include <vector>
using namespace std;

vector<int> v;

int main()
{
    FILE *fin, *fout;

    fin = fopen("permutari.in", "r");
    fout = fopen("permutari.out", "w");

    int n;

    fscanf(fin, "%d", &n);

    for(int i = 1; i <= n; i++)
    {
        v.push_back(i);
        fprintf(fout, "%d ", i);
    }
    fprintf(fout, "\n");

    while(next_permutation(v.begin(), v.end()))
    {
        for(int i = 0; i < n; i++)
            fprintf(fout, "%d ", v[i]);
        fprintf(fout, "\n");
    }




    return 0;
}