#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using ll=long long;
using vi=vector<int>;
using pii=pair<int,int>;
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)
#define FORE(x,c) for(auto &&x:c)
#define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define SZ(c) ((int)c.size())
#define CONTAIN(c,x) (c.find(x)!=end(c))
#define INSEG(l,x,r) ((l)<=(x)&&(x)<(r))
#define dump(...)
#define pb push_back
#define _ 0
const signed INF_=1001001001; const long long INF=1001001001001001001LL;
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) {
    ITR(i,begin(v),end(v))os<<*i<<(i==end(v)-1?"":" ");return os;}
template<class T> istream& operator>>(istream &is,vector<T> &v) {
    ITR(i,begin(v),end(v)) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
    is>>p.first>>p.second;return is;}
template<class T, class U> bool chmax(T &a,const U &b){return a<b?a=b,1:0;}
template<class T, class U> bool chmin(T &a,const U &b){return a>b?a=b,1:0;}
template <class T> void PSUM(T& c) {partial_sum(begin(c), end(c), begin(c));}
template<class T> using heap=priority_queue<T,vector<T>,greater<T>>;
struct before_main_function {
    before_main_function() {
        cin.tie(0); ios::sync_with_stdio(0);
        cout << setprecision(15) << fixed;
        // #define endl "\n"
    }
} before_main_function;
//------------------8<------------------------------------8<--------------------

template <int mod>
class ModInt {
public:
    ModInt() : v(0) {}
    ModInt(int x) : v((x+mod)%mod) {}
    int value() const {return v;}
    const ModInt operator+(const ModInt &r) const { return ModInt(this->v + r.v); }
    const ModInt operator-(const ModInt &r) const { return ModInt(this->v + mod - r.v); }
    const ModInt operator*(const ModInt &r) const { return ModInt(this->v * r.v); }
    const ModInt operator/(const ModInt &r) const { return (*this * (~r)); }
    const ModInt operator^(int k) const { return ModInt(bpow(this->v, k)); }
    const ModInt operator~() const { return ModInt(bpow(this->v, mod-2)); }
    bool operator==(const ModInt &r) const { return this->v == r.v; }
    bool operator!=(const ModInt &r) const { return this->v != r.v; }
    ModInt& operator+=(const ModInt &r) { return *this = *this + r; }
    ModInt& operator-=(const ModInt &r) { return *this = *this - r; }
    ModInt& operator*=(const ModInt &r) { return *this = *this * r; }
    ModInt& operator/=(const ModInt &r) { return *this = *this * (~r); }
private:
    int v;
    int bpow(int a, int b) const {
        int ret = 1;
        while (b > 0) {
            if (b & 1) ret = (ret * a) % mod;
            a = (a * a) % mod;
            b >>= 1;
        }
        return ret;
    }
};
using Mint = ModInt<1000000007>;

Mint dp[101][5][5][5];
string ch = "ATCG";
signed main() {
    int N;
    cin >> N;
    set<string> ng;
    REP(i, 5) {
        string s;
        if (i < 4) s += ch[i];
        s += "AGC";
        ng.insert(s);
        REP(j, 3) {
            string t = s;
            swap(t[j], t[j + 1]);
            ng.insert(t);
        }
        s = "AGC";
        if (i < 4) s += ch[i];
        ng.insert(s);
        REP(j, 3) {
            string t = s;
            swap(t[j], t[j + 1]);
            ng.insert(t);
        }
    }

    dp[0][4][4][4] = 1;
    REP(i, N) {
        REP(p1, 5) {
            REP(p2, 5) {
                REP(p3, 5) {
                    string tmp = "";
                    if (p1 < 4) tmp += ch[p1];
                    if (p2 < 4) tmp += ch[p2];
                    if (p3 < 4) tmp += ch[p3];
                    REP(x, 4) {
                        string s = tmp + ch[x];
                        if (CONTAIN(ng, s)) continue;
                        dp[i + 1][p2][p3][x] += dp[i][p1][p2][p3];
                    }
                }
            }
        }
    }
    Mint ans = 0;
    REP(i, 5) {
        REP(j, 5) {
            REP(k, 5) {
                ans += dp[N][i][j][k];
            }
        }
    }
    cout << ans.value() << endl;
    return (0^_^0);
}



Measured memory_bytes: 384