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

}