#include<bits/stdc++.h>
using namespace std;
#define MD 1000000007
void *wmem;
template<class T> void malloc1d(T **arr, int x){
  (*arr) = (T*)malloc(x*sizeof(T));
}
template<class T> void free1d(T *arr){
  free(arr);
}
template<class T> void malloc2d(T ***arr, int x, int y){
  int i;
  (*arr) = (T**)malloc(x*sizeof(T*));
  (*arr)[0] = (T*)malloc(x*y*sizeof(T));
  for(i=1;i<x;i++){
    (*arr)[i]=(*arr)[i-1]+y;
  }
}
template<class T> void free2d(T **arr){
  free(arr[0]);
  free(arr);
}
struct mint{
  static unsigned R, RR, Rinv, W, md, mdninv;
  unsigned val;
  mint(){
  }
  mint(int a){
    val = mulR(a);
  }
  mint(unsigned a){
    val = mulR(a);
  }
  mint(long long a){
    val = mulR(a);
  }
  mint(unsigned long long a){
    val = mulR(a);
  }
  int get_inv(long long a, int md){
    long long e, s=md, t=a, u=1, v=0;
    while(s){
      e=t/s;
      t-=e*s;
      u-=e*v;
      swap(t,s);
      swap(u,v);
    }
    if(u<0){
      u+=md;
    }
    return u;
  }
  void setmod(unsigned m){
    int i;
    unsigned t;
    W = 32;
    md = m;
    R = (1ULL << W) % md;
    RR = (unsigned long long)R*R % md;
    switch(m){
      case 104857601:
      Rinv = 2560000;
      mdninv = 104857599;
      break;
      case 998244353:
      Rinv = 232013824;
      mdninv = 998244351;
      break;
      case 1000000007:
      Rinv = 518424770;
      mdninv = 2226617417U;
      break;
      case 1000000009:
      Rinv = 171601999;
      mdninv = 737024967;
      break;
      case 1004535809:
      Rinv = 234947584;
      mdninv = 1004535807;
      break;
      case 1007681537:
      Rinv = 236421376;
      mdninv = 1007681535;
      break;
      case 1012924417:
      Rinv = 238887936;
      mdninv = 1012924415;
      break;
      case 1045430273:
      Rinv = 254466304;
      mdninv = 1045430271;
      break;
      case 1051721729:
      Rinv = 257538304;
      mdninv = 1051721727;
      break;
      default:
      Rinv = get_inv(R, md);
      mdninv = 0;
      t = 0;
      for(i=0;i<(int)W;i++){
        if(t%2==0){
          t+=md;
          mdninv |= (1U<<i);
        }
        t /= 2;
      }
    }
  }
  unsigned mulR(unsigned a){
    return (unsigned long long)a*R%md;
  }
  unsigned mulR(int a){
    if(a < 0){
      a = a%md+md;
    }
    return mulR((unsigned)a);
  }
  unsigned mulR(unsigned long long a){
    return mulR((unsigned)(a%md));
  }
  unsigned mulR(long long a){
    a %= md;
    if(a < 0){
      a += md;
    }
    return mulR((unsigned)a);
  }
  unsigned reduce(unsigned T){
    unsigned m=T * mdninv, t=(unsigned)((T + (unsigned long long)m*md) >> W);
    if(t >= md){
      t -= md;
    }
    return t;
  }
  unsigned reduce(unsigned long long T){
    unsigned m=(unsigned)T * mdninv, t=(unsigned)((T + (unsigned long long)m*md) >> W);
    if(t >= md){
      t -= md;
    }
    return t;
  }
  unsigned get(){
    return reduce(val);
  }
  mint &operator+=(mint a){
    val += a.val;
    if(val >= md){
      val -= md;
    }
    return *this;
  }
  mint &operator-=(mint a){
    if(val < a.val){
      val = val + md - a.val;
    }
    else{
      val -= a.val;
    }
    return *this;
  }
  mint &operator*=(mint a){
    val = reduce((unsigned long long)val*a.val);
    return *this;
  }
  mint &operator/=(mint a){
    return *this *= a.inverse();
  }
  mint operator+(mint a){
    return mint(*this)+=a;
  }
  mint operator-(mint a){
    return mint(*this)-=a;
  }
  mint operator*(mint a){
    return mint(*this)*=a;
  }
  mint operator/(mint a){
    return mint(*this)/=a;
  }
  mint operator+(int a){
    return mint(*this)+=mint(a);
  }
  mint operator-(int a){
    return mint(*this)-=mint(a);
  }
  mint operator*(int a){
    return mint(*this)*=mint(a);
  }
  mint operator/(int a){
    return mint(*this)/=mint(a);
  }
  mint operator+(long long a){
    return mint(*this)+=mint(a);
  }
  mint operator-(long long a){
    return mint(*this)-=mint(a);
  }
  mint operator*(long long a){
    return mint(*this)*=mint(a);
  }
  mint operator/(long long a){
    return mint(*this)/=mint(a);
  }
  mint operator-(void){
    mint res;
    if(val){
      res.val=md-val;
    }
    else{
      res.val=0;
    }
    return res;
  }
  operator bool(void){
    return val!=0;
  }
  operator int(void){
    return get();
  }
  operator long long(void){
    return get();
  }
  mint inverse(){
    int a=val, b=md, t, u=1, v=0;
    mint res;
    while(b){
      t = a / b;
      a -= t * b;
      swap(a, b);
      u -= t * v;
      swap(u, v);
    }
    if(u < 0){
      u += md;
    }
    res.val = (unsigned long long)u*RR % md;
    return res;
  }
  mint pw(unsigned long long b){
    mint a(*this), res;
    res.val = R;
    while(b){
      if(b&1){
        res *= a;
      }
      b >>= 1;
      a *= a;
    }
    return res;
  }
  bool operator==(int a){
    return mulR(a)==val;
  }
  bool operator!=(int a){
    return mulR(a)!=val;
  }
}
;
mint operator+(int a, mint b){
  return mint(a)+=b;
}
mint operator-(int a, mint b){
  return mint(a)-=b;
}
mint operator*(int a, mint b){
  return mint(a)*=b;
}
mint operator/(int a, mint b){
  return mint(a)/=b;
}
mint operator+(long long a, mint b){
  return mint(a)+=b;
}
mint operator-(long long a, mint b){
  return mint(a)-=b;
}
mint operator*(long long a, mint b){
  return mint(a)*=b;
}
mint operator/(long long a, mint b){
  return mint(a)/=b;
}
inline void rd(int &x){
  int k, m=0;
  x=0;
  for(;;){
    k = getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void wt_L(char a){
  putchar_unlocked(a);
}
inline void wt_L(int x){
  char f[10];
  int m=0, s=0;
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    putchar_unlocked('-');
  }
  while(s--){
    putchar_unlocked(f[s]+'0');
  }
}
inline void wt_L(mint x){
  int i;
  i = (int)x;
  wt_L(i);
}
template<class S> struct AhoCorasick_Sum{
  S *sum;
  int alphabet, *failed, mem, node, **nx;
  void init(void){
    int i;
    node = 1;
    for(i=0;i<alphabet;i++){
      nx[0][i] = -1;
    }
    failed[0] = 0;
    sum[0] = 0;
  }
  void malloc(const int n, const int k){
    int i;
    malloc2d(&nx,n,k);
    malloc1d(&failed,n);
    malloc1d(&sum,n);
    node = n;
    alphabet = k;
    init();
  }
  void free(void){
    free2d(nx);
    free1d(failed);
    free1d(sum);
  }
  template<class T> void addWord(const T word[], const int len, S val){
    int i, j, k, now=0;
    for(i=0;i<len;i++){
      if(nx[now][word[i]]==-1){
        k = node++;
        nx[now][word[i]] = k;
        for(j=0;j<alphabet;j++){
          nx[k][j] = -1;
        }
        sum[k] = 0;
      }
      now = nx[now][word[i]];
    }
    sum[now] += val;
  }
  void construct(void *mem = wmem){
    int i, j, k, now, *q, qe, qs;
    q = (int*) mem;
    qs = qe = 0;
    now = 0;
    for(k=0;k<alphabet;k++){
      if(nx[now][k] != -1){
        q[qe++] = nx[now][k];
        failed[ nx[now][k] ] = now;
      }
    }
    while(qs < qe){
      now = q[qs++];
      for(k=0;k<alphabet;k++){
        if(nx[now][k] != -1){
          i = failed[now];
          while(i){
            if(nx[i][k] != -1){
              break;
            }
            i = failed[i];
          }
          if(nx[i][k] != -1){
            i = nx[i][k];
          }
          failed[ nx[now][k] ] = i;
          sum[ nx[now][k] ] += sum[i];
          q[qe++] = nx[now][k];
        }
      }
    }
  }
  template<class T> inline int next(const int n, const T c){
    int i, now;
    now = n;
    if(nx[n][c]!=-1){
      return nx[n][c];
    }
    while(now && nx[now][c]==-1){
      now=failed[now];
    }
    if(nx[now][c]!=-1){
      now = nx[now][c];
    }
    return nx[n][c] = now;
  }
}
;
char memarr[96000000];
unsigned mint::R, mint::RR, mint::Rinv, mint::W, mint::md, mint::mdninv;
int N;
mint dp[23];
mint nx[23];
int dame[11][4] = {
  {0, 2, 1, -1},
  {2, 0, 1, -1},
  {0, 1, 2, -1},
  {0, 0, 2, 1},
  {0, 1, 2, 1},
  {0, 2, 2, 1},
  {0, 3, 2, 1},
  {0, 2, 0, 1},
  {0, 2, 1, 1},
  {0, 2, 2, 1},
  {0, 2, 3, 1}
};
int main(){
  AhoCorasick_Sum<int> aho;
  int Lj4PdHRW, i, j, k, x;
  mint res;
  wmem = memarr;
  {
    mint x;
    x.setmod(MD);
  }
  rd(N);
  aho.malloc(23, 4);
  for(i=0;i<3;i++){
    aho.addWord(dame[i], 3, 1);
  }
  for(i=3;i<11;i++){
    aho.addWord(dame[i], 4, 1);
  }
  aho.construct();
  k = aho.node;
  dp[0] = 1;
  for(Lj4PdHRW=0;Lj4PdHRW<N;Lj4PdHRW++){
    for(i=0;i<k;i++){
      nx[i] = 0;
    }
    for(i=0;i<k;i++){
      for(j=0;j<4;j++){
        x = aho.next(i, j);
        if(aho.sum[x]){
          continue;
        }
        nx[x] += dp[i];
      }
    }
    for(i=0;i<k;i++){
      dp[i] = nx[i];
    }
  }
  {
    int KL2GvlyY;
    mint Q5VJL1cS;
    if(k==0){
      Q5VJL1cS = 0;
    }
    else{
      Q5VJL1cS = dp[0];
      for(KL2GvlyY=1;KL2GvlyY<k;KL2GvlyY++){
        Q5VJL1cS += dp[KL2GvlyY];
      }
    }
    res =Q5VJL1cS;
  }
  wt_L(res);
  wt_L('\n');
  return 0;
}
// cLay varsion 20190714-1

// --- original code ---
// int N;
// mint dp[23], nx[23];
// 
// int dame[11][4] = {
//   {0, 2, 1, -1},
//   {2, 0, 1, -1},
//   {0, 1, 2, -1},
//   {0, 0, 2, 1},
//   {0, 1, 2, 1},
//   {0, 2, 2, 1},
//   {0, 3, 2, 1},
//   {0, 2, 0, 1},
//   {0, 2, 1, 1},
//   {0, 2, 2, 1},
//   {0, 2, 3, 1}
// };
// 
// {
//   int i, j, k, x;
//   mint res;
//   AhoCorasick_Sum<int> aho;
//   rd(N);
// 
//   aho.malloc(23, 4);
//   rep(i,3) aho.addWord(dame[i], 3, 1);
//   rep(i,3,11) aho.addWord(dame[i], 4, 1);
//   aho.construct();
// 
//   k = aho.node;
//   
//   dp[0] = 1;
//   rep(N){
//     rep(i,k) nx[i] = 0;
//     rep(i,k) rep(j,4){
//       x = aho.next(i, j);
//       if(aho.sum[x]) continue;
//       nx[x] += dp[i];
//     }
//     rep(i,k) dp[i] = nx[i];
//   }
// 
//   res = sum(dp(k));
//   wt(res);
// }


Measured memory_bytes: 256