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


#define li          long long int
#define rep(i,to)   for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)    for(li i=(li)(start);i<((li)(to));i++)
#define pb          push_back
#define sz(v)       ((li)(v).size())
#define bgn(v)      ((v).begin())
#define eend(v)     ((v).end())
#define allof(v)    (v).begin(), (v).end()
#define dodp(v,n)       memset(v,(li)n,sizeof(v))
#define bit(n)      (1ll<<(li)(n))
#define mp(a,b)     make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1


#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b)     idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)       idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j)        idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v)   for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x)      idp p2((x).F, (x).S)
#define dump(x,n)   idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n)  idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x)    idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x)   idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}

#define read2d(a,w,h)   rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h)   rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}

typedef pair<li, li> PI;

#define UF_NUM 505050

li dp[111][5][5][5];

li n;

inline bool check(li x, li y, li z) {
    // 0,1,2
    if (x == 0 && y == 1 && z == 2) {
        return false;
    }
    // 1,0,2
    if (x == 1 && y == 0 && z == 2) {
        return false;
    }
    // 0,2,1
    if (x == 0 && y == 2 && z == 1) {
        return false;
    }
    return true;
}

inline bool check(li w, li x, li y, li z) {
    // 0,1,2
    if (x == 0 && y == 1 && z == 2) {
        return false;
    }
    // 1,0,2
    if (x == 1 && y == 0 && z == 2) {
        return false;
    }
    // 0,2,1
    if (x == 0 && y == 2 && z == 1) {
        return false;
    }

    // 0,x,1,2
    if (w == 0 && y == 1 && z == 2) {
        return false;
    }
    // 0,1,x,2
    if (w == 0 && x == 1 && z == 2) {
        return false;
    }
    return true;
}

int main() {
    cin >> n;
    rep(i, 4) {
        rep(j, 4) {
            rep(k, 4) {
                dp[3][i][j][k] = (check(k, j, i) ? 1 : 0);
            }
        }
    }
    repp(i, 4, n + 1) {
        rep(i3, 4) {
            rep(i2, 4) {
                rep(i1, 4) {
                    rep(j, 4) {
                        if (check(i3, i2, i1, j)) {
                            dp[i][j][i1][i2] = (dp[i][j][i1][i2] + dp[i - 1][i1][i2][i3]) % MOD;
                        }
                    }
                }
            }
        }
    }

    li res = 0;
    rep(i, 4) {
        rep(j, 4) {
            rep(k, 4) {
                res += dp[n][i][j][k];
            }
        }
    }
    cout << res % MOD << endl;

    return 0;
}

Measured memory_bytes: 384