#include <cstdio>
#include <algorithm>
using namespace std;
FILE *fi=fopen("permutari.in","r");
FILE *fo=fopen("permutari.out","w");

int REZ[20];
int N,k;

int factorial(int n)
{
    if(n==1)
        return 1;
    return n*factorial(n-1);
}

int main()
{
    fscanf(fi,"%d",&N);
    for(int i=1;i<=N;i++)
        REZ[i]=i;
    k=factorial(N);
    for(int i=1;i<=k;i++)
    {
        for(int i=1;i<=N;i++)
            fprintf(fo,"%d ",REZ[i]);
        fprintf(fo,"\n");
        next_permutation(REZ+1,REZ+N+1);
    }
    fclose(fi);
    fclose(fo);
    return 0;
}