#include <bits/stdc++.h>
using namespace std;

#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int (i) = (m); (i) < (n); ++(i))
#define dbg(x) cerr << #x << ": " << x << endl;
#define dbg2(x, y) cerr<<"("<<#x<<", "<<#y<<") = "<<"("<<x<<", "<<y<<")"<<endl;
#define dbg3(x, y, z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = "<<"("<<x<<", "<<y<<", "<<z<<")"<<endl;
#define dbgB(value, size) cerr<<#value<<": "<<bitset<size>(value) << endl;
#define line() cerr << "---------------" << endl;

const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const double PI = 3.14159265358979323846;

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 (b<a) { a = b; return 1; } return 0; }

template<typename T>
void print1(T begin, T end) {
  while (begin != end) {
    cout << (*begin) << " ";
    *begin++;
  }
  cout << endl;
}

template<typename T>
void print2(T Array, int height, int width) {
  for (int i = 0; i < height; i++) {
    for (int j = 0; j < width; j++) {
      cout << " " << Array[i][j];
    }
    cout << endl;
  }
}

void print() { std::cerr << endl; }
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
  std::cerr << head << " ";
  print(std::forward<Tail>(tail)...);
}

template<class T>
void Add(T &a, const T &b, const T &mod=1000000007) {
  int val = ((a % mod) + (b % mod)) % mod;
  if (val < 0) { val += mod; }
  a = val;
}

template <typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template <typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }

// ------------------------------------------------------------------------------------------

const int mod = 1e9+7;

int N;
auto dp = vectors(111, 9, 9, 9, 0);
vector<int> AGCT = {'A', 'G', 'C', 'T'};

bool isAGC(vector<int> C) {
  return C[0] == 0 and C[1] == 1 and C[2] == 2;
}


signed main() {
  cin >> N;
  N--;
  int M = AGCT.size();

  rep (i, 5) {
    dp[0][i][i][i] = 1;
  }

  rep (i, N) {
    for (int c3 = 0; c3 < M; c3++) {
      for (int c2 = 0; c2 < M; c2++) {
        for (int c1 = 0; c1 < M; c1++) {
          for (int now = 0; now < M; now++) {
            bool ok = true;
            vec<int> t = {c3, c2, c1, now};
            if (isAGC({c3, c2, c1}) or isAGC({c2, c1, now})) ok = false;

            rep (i, t.size()-1) {
              vec<int> tt = t;
              swap(tt[i], tt[i+1]);
              if (isAGC({tt[0], tt[1], tt[2]}) or isAGC({tt[1], tt[2], tt[3]})) ok = false;
            }

            if (ok) {
              // dp[i+1][c2][c1][now] += dp[i][c3][c2][c1];
              Add(dp[i+1][c2][c1][now], dp[i][c3][c2][c1]);
            }
          }
        }
      }
    }
  }

  int ans = 0;
  for (int c3 = 0; c3 < M; c3++) {
    for (int c2 = 0; c2 < M; c2++) {
      for (int c1 = 0; c1 < M; c1++) {
        // ans += dp[N][c3][c2][c1];
        Add(ans, 1LL*dp[N][c3][c2][c1]);
      }
    }
  }

  cout << ans << endl;

  return 0;
}

Measured memory_bytes: 896