#include<iostream>

 #include<cstring>

 #include<cmath>

 #include<cstdio>

 #include<algorithm>

 #include<map>

 #include<set>

 #include<vector>

 using namespace std;

 #define ll long long

 #define inf 99999999

 int n;

 int out[];

 int book[];

 void dfs(int step)

 {

     if(step==n+)

     {

         for(int i=;i<=n;i++)

             printf("%d%c",out[i],i==n?'\n':' ');

         return ;

     }

     for(int i=;i<=n;i++)

     {

         if(book[i]==)

         {

             out[step]=i;

             book[i]=;

             dfs(step+);

             book[i]=;

         }

     }

     return ;

 }

 int main()

 {

     scanf("%d",&n);

     dfs();

     return ;

 }