/*
TASK: necklace
LANG: C++
*/
#include<iostream.h>
#include<math.h>
	unsigned long long a[101],b[70];
	unsigned long long br,br1,br2,br0,n,x,y,p,q,x1;
int main()
{
cin>>n;
x=2<<n-1;
br2=0;
for(br=1; br<=x; br++)
{
 br1=0;
 y=br;
 p=0;
 q=0;
 do
 {
  br1++;
  b[br1]=y%2;
  y/=2;
 }
 while(y!=0);
 if(b[n]==1)
 {
  for(br0=1; br0<=n; br0++)
  {
   if(b[br0]==1 && br0%2==0) q++;
   if(b[br0]==1 && br0%2==1) p++;
  }
  if((abs(p-q))%3==0)
   br2++;
 }
}
cout<<br2<<endl;
return 0;
}
