#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os, const map<T,U>& mp){ os << "{"; for(auto& p : mp){ os << p << ","; } os << "}"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
using ll = long long;
using ull = unsigned long long;
using pii = std::pair<int,int>;
using vi = std::vector<int>;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

ll dp[101][6][6][6];

int main(){
    int N; cin >> N;
    dp[0][0][0][0] = 1;
    for(int i=0;i<N;i++){
        for(int a=0;a<=4;a++){
            for(int b=0;b<=4;b++){
                for(int c=0;c<=4;c++){
                    for(int d=1;d<=4;d++){
                        if(b==1 && c==3 && d==2) continue; // AGC
                        if(a==1 && c==3 && d==2) continue; // A*GC
                        if(b==3 && c==1 && d==2) continue; // GAC
                        if(b==1 && c==2 && d==3) continue; // ACG
                        if(a==1 && b==3 && d==2) continue; // AG*C

                        dp[i+1][b][c][d] += dp[i][a][b][c];
                        dp[i+1][b][c][d] %= mod;
                    }
                }
            }
        }
    }

    ll sum = 0;
    for(int i=1;i<=4;i++){
        for(int j=1;j<=4;j++){
            for(int k=1;k<=4;k++){
                sum += dp[N][i][j][k];
                sum %= mod;
            }
        }
    }
    cout << sum << endl;

    /* for(int n=0;n<=N;n++){ */
    /*     for(int i=1;i<=4;i++){ */
    /*         for(int j=1;j<=4;j++){ */
    /*             for(int k=1;k<=4;k++){ */
    /*                 printf("dp[%d][%d][%d][%d] = %lld\n", n,i,j,k,dp[n][i][j][k]); */
    /*             } */
    /*         } */
    /*     } */
    /* } */
}


Measured memory_bytes: 3704