#include<stdio.h>
long n,a[100],k,k1,aa,j;
long nf,i;
int main()
{
 freopen("permutari.in","r",stdin);
 freopen("permutari.out","w",stdout);
 scanf("%ld",&n);
 nf=1;
 a[1]=1;
 printf("1 ");
 for(i=2;i<=n;++i){a[i]=i;printf("%ld ",i);nf*=i;}
 printf("\n");
 for(i=1;i<nf;++i)
    {
     for(k=n-1;a[k]>a[k+1];--k);
     for(k1=n;a[k]>a[k1];--k1);
     aa=a[k];
     a[k]=a[k1];
     a[k1]=aa;
     for(j=k+1;j<=(n+k+1)/2;++j)
       {aa=a[j];
	a[j]=a[n-j+k+1];
	a[n-j+k+1]=aa;
       }
     for(j=1;j<=n;++j)printf("%ld ",a[j]);
     printf("\n");
    }
 return 0;
}