/*
TASK:necklace
LANG:C++
*/
#include <iostream>
#include <algorithm>
using namespace std;
int n,m[61],c=0;
int abs(int a)
{
  if (a >= 0) return a;
     else return -a;
}       
void in()
{
 cin>>n;    
}
void null()
{
 for (int i=1;i<=n;i++)
      m[i]=0;
}
bool check()
{ 
  int sum;   
  int p=0,q=0;
  for (int u=1;u<=n;u++)
       if (m[u] == 1 && u%2 == 0) p++;
          else if (m[u] == 1) q++;
  sum=p-q;        
  if (abs(sum)%3 == 0) return 1;
     else return 0;
}               
     
     
void solve()
{int j;
 for (int i=1;i<=n;i++)
        {
         for (j=1;j<=i;j++)
               m[j]=1;
         while(next_permutation(m+1,m+j));     
              {
               next_permutation(m,m+j);
               if (check() == 1) c++;
              }
         null();      
        }
}
void out()
{
 cout << c <<"\n";
}
int main()
{
 in();
 solve();
 out();
 cin >>n;
 return 0;
}         
                    
                                  


