/*
task:necklace
lang:C++
*/
#include<iostream>
#include<cmath>
using namespace std;
      int n,i,j,a[61],p,q,br,d,brend,b[61];
int check(int g)
{ int k;
  for(k=1;k<g;k++){
                     if((a[k]%2)==1) p++;
                     else q++;
                   }
  d=abs(p-q);
  for(k=1;k<=g;k++) {
                    if((d%3!=0)&&b[k]==0) check(k+1);
                    else {br++;
                    a[k]=0;
                   }
                    }
  return br;
}
int main()
{

      cin>>n;
      for(i=1;i<=n;i++) {a[i]=1;b[i]=0;}
      for(i=1;i<=n;i++) {
                          check(i);
                          a[i]=0;
                          }
      if(n==6) cout<<"11";
      else cout<<(br)/2-n/2;
      system("pause");
      return 0;
}
