#include <bits/stdc++.h>
#include <unistd.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}


typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//#define mp make_pair


#define vlll vector<vll>
#define vllll vector<vlll>

/*
int main() {
  set<string> st;
  string s = "AGC";
  string t = "ACGT";
  st.insert(s);
  rep (i, 3) {
    string sss = s;
    swap(sss[i], sss[i + 1]);
    st.insert(sss);
  }
  rep (i, 4) {
    string ss = s;
    ss += t[i];
    st.insert(ss);
    rep (j, 3) {
      string sss = ss;
      swap(sss[j], sss[j + 1]);
      st.insert(sss);
    }
  }

  rep (i, 4) {
    string ss = s;
    ss = t[i] + ss;
    st.insert(ss);
    rep (j, 3) {
      string sss = ss;
      swap(sss[j], sss[j + 1]);
      st.insert(sss);
    }
  }

  int n;
  cin >> n;
  vllll dp(n + 1, vlll(4, vll(4, vl(4))));
  rep (i, 4) {
    rep (j, 4) {
      rep (k, 4) {
        string temp;
        temp += t[i];
        temp += t[j];
        temp += t[k];
        if (st.count(temp)) continue;
        dp[3][i][j][k] = 1;
      }
    }
  }

  for (int x = 3; x < n; x++) {
    rep (i, 4) rep (j, 4) rep (k, 4) {
      if (dp[x][i][j][k] == 0) continue;
      string now;
      now += t[i];
      now += t[j];
      now += t[k];
      if (st.count(now)) continue;
      rep (l, 4) {
        now += t[l];
        if (st.count(now)) continue;
        (dp[x + 1][j][k][l] += dp[x][i][j][k]) %= MOD;
      }
    }
  }
  ll ans = 0;
  rep (i, 4) rep (j, 4) rep (k, 4) {
    (ans += dp[n][i][j][k]) %= MOD;
  }
  cout << ans << endl;
}
//*/

bool judge(string s) {
  string t = "AGC";
  if (s.substr(0, 3) == t) return false;
  if (s.substr(1, 3) == t) return false;
  rep (i, 3) {
    string ss = s;
    swap(ss[i], ss[i + 1]);
    if (ss.substr(0, 3) == t) return false;
    if (ss.substr(1, 3) == t) return false;
  }
  return true;
}

int main() {
  int n;
  cin >> n;
  vllll dp(n + 1, vlll(4, vll(4, vl(4))));
  dp[0][0][0][0] = 1;
  string t = "AGCT";
  rep (x, n) {
    rep (i, 4) {
      rep (j, 4) {
        rep (k, 4) {
          rep (l, 4) {
            if (x >= 2) {
              string s;
              s += t[j];
              s += t[k];
              s += t[l];
              if (s == "AGC") continue;
              bool flag = true;
              rep (m, 2) {
                string ss = s;
                swap(ss[m], ss[m + 1]);
                if (ss == "AGC") flag = false;
              }
              if (!flag) continue;
            }
            if (x >= 3) {
              string s;
              s += t[i];
              s += t[j];
              s += t[k];
              s += t[l];
              if (!judge(s)) continue;
            }
            (dp[x + 1][j][k][l] += dp[x][i][j][k]) %= MOD;
          }
          
        }
      }
    }
  }
  ll ans = 0;
  rep (i, 4) rep (j, 4) rep (k, 4) {
    (ans += dp[n][i][j][k]) %= MOD;
  }
  cout << ans << endl;
}


Measured memory_bytes: 384