#include <cstdio>

 #include <algorithm>

 using namespace std;

 const int N = ;

 int n, ans;

 int l[N], r[N], d[N], tl, tr, td;

 void DFS(int k) {

     if(k == n) {

         ans++;

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

             printf("%d", l[i]);

         }

         printf("%d", td ? d[td] : r[tr]);

         if(ans == ) exit();

         printf("\n");

         return;

     }

     if(td) {

         l[++tl] = d[td--];

         DFS(k + );

         d[++td] = l[tl--];

     }

     if(!tr) return;

     int temp = tr;

     l[++tl] = r[tr--];

     while(tr) {

         DFS(k + );

         d[++td] = l[tl];

         l[tl] = r[tr--];

     }

     DFS(k + );

     /// 复原

     tr = temp;

     tl--;

     td -= (temp - );

     return;

 }

 int main() {

     scanf("%d", &n);

     for(int i = n; i >= ; i--) {

         r[i] = n - i + ;

     }

     tr = n;

     DFS();

     return ;

 }