#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int a[3][4];
vector<vector<int>> v;
void dfs(int k){
    bool myon=0;
    for(int i=0; i<3; i++){
        for(int j=0; j<3; j++){
            if(!a[i][j] && !a[i][j+1]){
                a[i][j]=a[i][j+1]=k;
                dfs(k+1);
                a[i][j]=a[i][j+1]=0;
                myon=1;
            }
        }
    }
    for(int i=0; i<4; i++){
        for(int j=0; j<2; j++){
            if(!a[j][i] && !a[j+1][i]){
                a[j][i]=a[j+1][i]=k;
                dfs(k+1);
                a[j][i]=a[j+1][i]=0;
                myon=1;
            }
        }
    }
    if(myon) return;
    vector<int> w(3);
    for(int j=0; j<4; j++){
        vector<int> w(3);
        if(a[0][j]==a[1][j] && a[1][j]!=0) w[0]=w[1]=3;
        else if(a[1][j]==a[2][j] && a[1][j]!=0) w[1]=w[2]=3;
        for(int i=0; i<3; i++){
            if(a[i][j]!=0 && w[i]!=3){
                if(j>0 && a[i][j-1]==a[i][j]) w[i]=1;
                else w[i]=2;
            }
        }
        v.push_back(w);
    }
}
const ll MOD=1e9+7;
vector<vector<ll>> matrixmul(int l, int m, int n, vector<vector<ll>> a, vector<vector<ll>> b){
	vector<vector<ll>> c(l, vector<ll>(n));
	for(int i=0; i<l; i++){
		for(int j=0; j<n; j++){
			for(int k=0; k<m; k++){
				(c[i][j]+=a[i][k]*b[k][j])%=MOD;
			}
		}
	}
	return c;
}
vector<vector<ll>> matrixpow(int n, vector<vector<ll>> a, ll k){
	vector<vector<ll>> ap=a, ans(n, vector<ll>(n));
	for(int i=0; i<n; i++) ans[i][i]=1;
	while(k){
		if(k&1) ans=matrixmul(n, n, n, ap, ans);
		ap=matrixmul(n, n, n, ap, ap);
		k>>=1;
	}
	return ans;
}
int main()
{
    ll n;
    cin>>n;
    dfs(1);
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    int m=v.size();
    vector<vector<ll>> mat(m, vector<ll>(m));
    for(int i=0; i<m; i++){
        for(int j=0; j<m; j++){
            bool dame=0;
            for(int k=0; k<3; k++){
                if(v[i][k]==2 && v[j][k]!=1){
                    dame=1;
                }
                if(v[j][k]==1 && v[i][k]!=2){
                    dame=1;
                }
                if(!v[i][k] && !v[j][k]) dame=1;
            }
            if(dame) continue;
            mat[i][j]++;
        }
    }
    auto matp=matrixpow(m, mat, n-1);
    ll ans=0;
    for(int i=0; i<m; i++){
        bool dame=0;
        for(int k=0; k<3; k++){
            if(v[i][k]==1) dame=1;
        }
        if(dame) continue;
        for(int j=0; j<m; j++){
            bool dame1=0;
            for(int k=0; k<3; k++){
                if(v[j][k]==2) dame1=1;
            }
            if(dame1) continue;
            (ans+=matp[i][j])%=MOD;
        }
    }
    cout<<ans<<endl;
	return 0;
}