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

using namespace std;

void read(),solve();
int n,x[10],f=1,i,j;
int main()
{
    read();
    solve();
    return 0;
}
void read()
{
     freopen("permutari.in","r",stdin);
     freopen("permutari.out","w",stdout);
     scanf("%d",&n);
}
void solve()
{
     for(i=1;i<=n;i++)
     {
         f*=i;
         x[i]=i;
     }
     for(i=1;i<=f;i++)
     {
         for(j=1;j<=n;j++)
         {
         printf("%d ",x[j]);
         printf("\n");
         next_permutation(x+1,x+n+1);                               
         }    
     }
}