#include <bits/stdc++.h>

 using namespace std;

 #define S second

 typedef long long ll;

 const int INF = 0x3f3f3f3f;

 const int M = 1e5+;

 int s;

 int cnt = ;

 bool vis[];

 void dfs( int last, int num )   {

     if( num == s )  {

         cnt++;

         return ;

     }

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

         if( abs(last-i)<= && !vis[i] ) {

             vis[i] = true;

             dfs( i, num+ );

             vis[i] = false;

         }

 }

 int main()  {

     while( ~scanf("%d", &s ) )   {

         memset( vis, false, sizeof(vis) );

         cnt = ;

         vis[] = true;

         dfs( ,  );

         printf("%d\n", cnt );

     }

     return ;

 }