#include<iostream>
#include<cstdio>
#include<cstring>
#include<iomanip>
#define MN 2200
#define mod 1000000000
using namespace std;
inline int read()
{int x = 0 , f = 1; char ch = getchar();while(ch < '0' || ch > '9'){ if(ch == '-') f = -1;  ch = getchar();}while(ch >= '0' && ch <= '9'){x = x * 10 + ch - '0';ch = getchar();}return x * f;
}struct Hpc
{int  len,s[100];void init(int x){memset(s,0,sizeof(int)*(len+1));s[1]=x;len=(x>0);}void operator += (Hpc y){len=max(len,y.len)+1;for(int i=1;i<=len;++i){s[i]+=y.s[i];if(s[i]>=mod){s[i+1]+=s[i]/mod;s[i]%=mod;}}if(!s[len]) --len;}void print(){printf("%d",s[len]);for(int i=len-1;i>0;--i)cout<<setw(9)<<setfill('0')<<s[i];}
}f[5][1<<12],ans;
int n,tot=0,s[MN+5],c[MN+5][8],q[8],top;int main()
{n=read();f[4][0].init(1);for(int i=0;i<1<<(4<<1)+2;++i){s[++tot]=i;top=0;for(int j=0;j<=4;++j){int x=i>>(j<<1);if((x&3)==3) {top=-1;break;}if((x&3)==1) q[++top]=j;if((x&3)==2){if(!top) {top=-1;break;}else c[tot][q[top]]=j,c[tot][j]=q[top],--top;}}if(top) --tot;}for(int i=1;i<=n;++i){for(int j=1;j<=tot;++j){if(s[j]&3) f[0][s[j]].init(0);else f[0][s[j]]=f[4][s[j]>>2];}for(int j=1;j<=4;++j){int x=(j-1)<<1;memset(f[j],0,sizeof(f[j]));for(int k=1;k<=tot;++k){int p=(s[k]>>x)&3;int q=(s[k]>>(x+2))&3;if(!p&&!q)  f[j][s[k]|(9<<x)]+=f[j-1][s[k]];else if(p&&q){if(p==1&&q==2){if(i==n&&j==4&&s[k]==(9<<x)) ans+=f[j-1][s[k]];}else if(p==1&&q==1)f[j][s[k]^(5<<x)^(3<<(c[k][j]<<1))]+=f[j-1][s[k]];else if(p==2&&q==1) f[j][s[k]^(6<<x)]+=f[j-1][s[k]];else if(p==2&&q==2) f[j][s[k]^(10<<x)^(3<<(c[k][j-1]<<1))]+=f[j-1][s[k]];}else{f[j][s[k]]+=f[j-1][s[k]];f[j][(s[k]^(p<<x)^(q<<x+2))|(p<<x+2)|(q<<x)]+=f[j-1][s[k]];}}}}ans+=ans;ans.print();return 0;
}