// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << ' ' << '=' << ' ' << (x) << endl;
#define fs first
#define sc second
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;
typedef vector<P> pvec;
typedef vector<vector<ll>> vvec;
typedef vector<vector<P>> pvvec;
typedef priority_queue<ll> PQI;
typedef priority_queue<P> PQP;
typedef priority_queue<ll,vector<ll>,greater<ll>> PQIG;
typedef priority_queue<P,vector<P>,greater<P>> PQPG;
const vector<int> dx = {0, -1, 0, 1, 1, 1, -1, -1};
const vector<int> dy = {1, 0, -1, 0, 1, -1, 1, -1};
const int MOD = (1000000007);
// const int MOD = (998244353);
// const int INF = (1 << 30);
const int INF = (1LL << 60);
const double EPS = (1 >> 30);
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; }
template< typename T > istream &operator>>(istream &is, vector< T > &v) { for(T &in : v) is >> in; return is; }

template<int MOD> struct modint {
    long long val;

    constexpr modint(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) v += MOD;
    }
    constexpr modint operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    
    constexpr int getmod() { return MOD; }
    constexpr modint operator + (const modint& r) const noexcept { return modint(*this) += r; }
    constexpr modint operator - (const modint& r) const noexcept { return modint(*this) -= r; }
    constexpr modint operator * (const modint& r) const noexcept { return modint(*this) *= r; }
    constexpr modint operator / (const modint& r) const noexcept { return modint(*this) /= r; }
    constexpr modint& operator += (const modint& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr modint& operator -= (const modint& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr modint& operator *= (const modint& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr modint& operator /= (const modint& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const modint& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const modint& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const modint<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr istream& operator >> (istream &is, modint<MOD>& x) noexcept {
        return is >> x.val;
    }
    friend constexpr modint<MOD> modpow(const modint<MOD> &a, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};
using mint = modint<MOD>;
typedef vector<mint> mvec;
typedef vector<vector<mint>> mvvec;

vector<string> str;
void init(string s){
    if(s.size()==3){
        str.pb(s);
        return;
    }
    init(s+"A");
    init(s+"T");
    init(s+"G");
    init(s+"C");
}
bool ch(string s){
    bool res=true;
    if(s[0]=='A'&&s[1]=='G'&&s[2]=='C') res=false;
    if(s[0]=='A'&&s[1]=='C'&&s[2]=='G') res=false;
    if(s[0]=='G'&&s[1]=='A'&&s[2]=='C') res=false;
    if(s[0]=='A'&&s[1]=='G'&&s[3]=='C') res=false;
    if(s[0]=='A'&&s[2]=='G'&&s[3]=='C') res=false;
    if(s[1]=='A'&&s[2]=='G'&&s[3]=='C') res=false;
    if(s[1]=='A'&&s[2]=='C'&&s[3]=='G') res=false;
    if(s[1]=='G'&&s[2]=='A'&&s[3]=='C') res=false;
    return res;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);
    //---------------------------------------------
    
    int n;
    cin>>n;
    init("");
    map<string,int> m;
    rep(i,4*4*4){
        m[str[i]]=i;
    }
    mvvec dp(100+10,mvec(4*4*4));
    rep(i,4*4*4) dp[0][i]=1;
    dp[0][m["AGC"]]=0;
    dp[0][m["ACG"]]=0;
    dp[0][m["GAC"]]=0;
    for(int i=0;i<=100;i++){
        for(int j=0;j<4*4*4;j++){
            string s=str[j];
            if(ch(s+"A")) dp[i+1][m[s.substr(1,2)+"A"]]+=dp[i][m[s]];
            if(ch(s+"T")) dp[i+1][m[s.substr(1,2)+"T"]]+=dp[i][m[s]];
            if(ch(s+"G")) dp[i+1][m[s.substr(1,2)+"G"]]+=dp[i][m[s]];
            if(ch(s+"C")) dp[i+1][m[s.substr(1,2)+"C"]]+=dp[i][m[s]];
        }
    }
    mint ans=0;
    rep(i,4*4*4){
        // cout<<str[i]<<" "<<dp[n-3][i]<<endl;
        ans+=dp[n-3][i];
    }
    cout<<ans<<endl;
}

Measured memory_bytes: 384