#include <stdio.h>
#include <cstring>
#include <stdlib.h>
#include <time.h>
#include <bitset>
#include <string>
#include <vector>
#include <math.h>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <limits.h>
#include <algorithm>
#include <deque>
#define nmax 2000010
#define inf 0x3f3f3f3f
using namespace std;
int n,i,nr,j,t[10],fr[10];
void back(int x)
{
    if (x==n+1) {
        for (i=1;i<=n;i++) printf("%d ",t[i]);
        printf("\n");
    } else
    {
        int i;
        for (i=1;i<=n;i++)
            if (fr[i]==0) { t[x]=i; fr[i]=1; back(x+1); fr[i]=0; }
    }
}
int main(){
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
back(1);
return 0;
}