#include <iostream>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <chrono>
#include <math.h>
using namespace std;

using lli = long long int;
using Vint = vector<int>;
using Vlli = vector<lli>;
using Wint = vector<Vint>;
using Wlli = vector<Vlli>;
using pii = pair<int, int>;
using pll = pair<lli, lli>;

constexpr int MOD = 1e9 + 7;
constexpr int INFi = 2e9 + 1;
constexpr lli INFl = (lli)(9e18) + 1;
const vector<pii> DXDY = {make_pair(1, 0), make_pair(-1, 0), make_pair(0, 1), make_pair(0, -1)};
constexpr char BR = '\n';

#define FOR(i, a, b) for(int (i) = (a); (i) < (b); (i)++)
#define FOReq(i, a, b) for(int (i) = (a); (i) <= (b); (i)++)
#define rFOR(i, a, b) for(int (i) = (b); (i) >= (a); i--)
#define FORstep(i, a, b, step) for(int (i) = (a); i < (b); i += (step))
#define REP(i, n) FOR(i, 0, n)
#define rREP(i, n) rFOR(i, 0, (n-1))
#define vREP(ele, vec) for(auto &(ele) : (vec))
#define vREPcopy(ele, vec) for(auto (ele) : (vec))
#define SORT(A) std::sort((A).begin(), (A).end())


template <class T> inline int argmin(vector<T> vec){return min_element(vec.begin(), vec.end()) - vec.begin();}
template <class T> inline int argmax(vector<T> vec){return max_element(vec.begin(), vec.end()) - vec.begin();}
template <class T> inline void chmax(T &a, T b){a = max(a, b);}
template <class T> inline void chmin(T &a, T b){a = min(a, b);}
inline int toInt(string &s){int res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
inline int toInt(const string s){int res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
inline long long int toLong(string &s){lli res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
inline long long int toLong(const string s){lli res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
template <class T> inline std::string toString(T n){
  if(n == 0) return "0";
  std::string res = "";
  if(n < 0){n = -n;while(n != 0){res += (char)(n % 10 + '0'); n /= 10;}
  std::reverse(res.begin(), res.end()); return '-' + res;}
  while(n != 0){res += (char)(n % 10 + '0'); n /= 10;} std::reverse(res.begin(), res.end()); return res;
}

// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

const char CHARS[4] = {'A', 'G', 'C', 'T'};

inline bool judge(int a, int b, int c){
  if(a == 0 and b == 1 and c == 2) return false;
  if(a == 1 and b == 0 and c == 2) return false;
  if(a == 0 and b == 2 and c == 1) return false;
  return true;
}

// Aから遷移する時
inline bool judge_A(int a, int b, int c){
  if(c == 2){
    if(a == 1 or b == 1) return false;
  }
  else if(c == 1 and a == 0 and b == 2) return false;
  return true;
}


int main(void){
  int n; cin >> n;
  // "AGC"を含まない, かつ一回の操作でこれは無理
  // ==> "AGC", "AXGC", "AGXC", "GAC", "ACG"を含まない
  // DP[idx][a][b][c] := 長さidx+3の文字列のもので,  末尾が CHARS[a, b, c]のもの
  int DP[n-2][4][4][4];
  REP(i, n-2) REP(j, 4) REP(k, 4) REP(l, 4) DP[i][j][k][l] = 0;
  REP(i, 4) REP(j, 4) REP(k, 4) DP[0][i][j][k] = (judge(i, j, k)) ? 1 : 0;
  for(int idx = 0; idx < n-3; idx++){
    // 配るdp
    // i = 0
    REP(j, 4) REP(k, 4) REP(new_i, 4) {
      if(judge_A(j, k, new_i)) DP[idx + 1][j][k][new_i] = (DP[idx + 1][j][k][new_i] + DP[idx][0][j][k]) % MOD;
    }
    for(int i = 1; i < 4; i++) REP(j, 4) REP(k, 4) REP(new_i, 4){
      if(judge(j, k, new_i)) DP[idx + 1][j][k][new_i] = (DP[idx + 1][j][k][new_i] + DP[idx][i][j][k]) % MOD;
    }
  }
  int res = 0;
  REP(i, 4) REP(j, 4) REP(k, 4) res = (res + DP[n-3][i][j][k]) % MOD;
  cout << res << BR;
  return 0;
}

Measured memory_bytes: 256