#include <cstdio>
#include <algorithm>
#define N 8
using namespace std;
int main(){
    int v[N],i,n;
    freopen("permutari.in","r",stdin);
    freopen("permutari.out","w",stdout);
    scanf("%d",&n);
    for (i=0;i<n;++i)
        v[i]=i+1;
    sort(v,v+n);
    do{
       for (i=0;i<n;++i)
           printf("%d ",v[i]);
       printf("\n");
    }while (next_permutation(v,v+n));
    return 0;
}