/*#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int i,v[8],n;
cin>>n;
for (i=0;i<n;i++) v[i]=i+1;
for (i=0;i<n;i++) {cout<<v[i]<<" ";} cout<<endl;
while(next_permutation(v,v+n)){for (i=0;i<n;i++) cout<<v[i]<<" "; cout<<endl; }
return 0;}*/

#include <iostream>
#include <stdio.h>
#include <algorithm>

using namespace std;

FILE *f=fopen("permutari.in","r");
FILE *g=fopen("permutari.out","w");

int i,v[20],n;



void afisare(int v[])
{
    for(i=0;i<n;i++)
    fprintf(g,"%d ",v[i]);
    fprintf(g,"\n");


    return;
}



int main()
{
    fscanf(f,"%d",&n);
    for(i=0;i<n;i++)v[i]=i+1;
    afisare(v);
     while ( next_permutation (v,v+n) )
     {
         afisare(v);
     }
    fclose(g);
    return 0;
}