#include<bits/stdc++.h>
using namespace std;
const long mod=1e9+7;
long N,dp[111][6][6][6][6];
long find(int now,int back1,int back2,int back3,int back4){
  if(dp[now][back1][back2][back3][back4]!=-1){
    return dp[now][back1][back2][back3][back4];
  }
  if(back1 == 0 && back2 == 1 && back4 == 2){
    return 0;
  }
  if(back2 == 0 && back3 == 1 && back4 == 2){
    return 0;
  }
  if(back1 == 0 && back3 == 1 && back4 == 2){
    return 0;
  }
  if(back2 == 0 && back3 == 2 && back4 == 1){
    return 0;
  }
  if(back2 == 1 && back3 == 0 && back4 == 2){
    return 0;
  }
  if(now==N){
    return 1;
  }
  long ans=0;
  for(int i=0;i<4;i++){
    ans+=find(now+1,back2,back3,back4,i);
  }
  return dp[now][back1][back2][back3][back4]=ans%mod;
}

int main(){
  cin>>N;
  memset(dp,-1,sizeof(dp));
  cout<<find(0,4,4,4,4)<<endl;
}
