#include <iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
FILE *f,*g;
short int a[9];
int N;

int main()
{
    f=fopen("permutari.in","r");
    g=fopen("permutari.out","w");
    fscanf(f,"%d",&N);
    int q=1,l,i;
    for(l=2;l<=N;l++) {q*=l;a[l]=l;}
    a[1]=1;
    for(l=1;l<=N;l++) fprintf(g,"%d ",a[l]);
    fprintf(g,"\n");
    for(l=1;l<=q-1;l++) {next_permutation(a+1,a+N+1);for(i=1;i<=N;i++) fprintf(g,"%d ",a[i]);fprintf(g,"\n");}

    return 0;
}