#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep2(j,n) for(int j = 0; j < (n); ++j)
#define rep3(k,n) for(int k = 0; k < (n); ++k)
#define rep4(l,n) for(int l = 0; l < (n); ++l)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define drep2(j,n) for(int j = (n)-1; j >= 0; --j)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define srep2(j,s,t) for (int j = s; j < t; ++j)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("YES");}else{puts("NO");}
const int MX = 200005;

int N;
int memo[101][4][4][4];

int dfs(int index,string last3) {
  if(index == N) {
    return 1;
  }
  int strToInt[3];
  rep(i,3){
    switch (last3[i])
    {
      case 'T':
        strToInt[i] = 0;
        break;
      case 'A':
        strToInt[i] = 1;
        break;
      case 'G':
      strToInt[i] = 2;
        break;
      case 'C':
        strToInt[i] = 3;
        break;
      default:
        break;
    }
  }
  if(memo[index][strToInt[0]][strToInt[1]][strToInt[2]] != -1) {
    return memo[index][strToInt[0]][strToInt[1]][strToInt[2]];
  }
  int n = 0;
  string t = "",a = "", g = "", c = "";
  t += last3[1];
  t += last3[2];
  t += 'T';
  a += last3[1];
  a += last3[2];
  a += 'A';
  g += last3[1];
  g += last3[2];
  g += 'G';
  c += last3[1];
  c += last3[2];
  c += 'C';
  n = (n + dfs(index+1,t)) % ((int)pow(10,9) + 7);
  n = (n + dfs(index+1,a)) % ((int)pow(10,9) + 7);
  if (!(last3[1] == 'A' && last3[2] == 'C')) {
    n = (n + dfs(index + 1,g)) % ((int)pow(10,9) + 7);
  }
  if (!((last3[1] == 'A' && last3[2] == 'G') || (last3[1] == 'G' && last3[2] == 'A') || (last3[0] == 'A' && last3[2] == 'G') || (last3[0] == 'A' && last3[1] == 'G'))) {
    n = (n + dfs(index + 1,c)) % ((int)pow(10,9) + 7);
  }
  memo[index][strToInt[0]][strToInt[1]][strToInt[2]] = n;
  return n;
}
int main() {
  rep(i,101) {
    rep2(j,4) {
      rep3(k,4){
        rep4(l,4) {
          memo[i][j][k][l] = -1;
        }
      }
    }
  }
  cin >> N;
  int ans = dfs(0,"TTT");
  cout << ans << endl;

  return 0;
}

Measured memory_bytes: 256