#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;
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;
}
struct unionfind{
    vector<int> par, sz;
    unionfind() {}
    unionfind(int n):par(n), sz(n, 1){
        for(int i=0; i<n; i++) par[i]=i;
    }
    int find(int x){
        if(par[x]==x) return x;
        return par[x]=find(par[x]);
    }
    void unite(int x, int y){
        x=find(x); y=find(y);
        if(x==y) return;
        if(sz[x]>sz[y]) swap(x, y);
        par[x]=y;
        sz[y]+=sz[x];
    }
    bool same(int x, int y){
        return find(x)==find(y);
    }
    int size(int x){
        return sz[find(x)];
    }
};
int dx[4]={1, 0, -1, 0}, dy[4]={0, 1, 0, -1};
const int n1=6;
bool used[4][n1];
vector<vector<P>> w;
void dfs(vector<P> v){
    int x=v.back().first, y=v.back().second;
    for(int k=0; k<4; k++){
        int x1=x+dx[k], y1=y+dy[k];
        if(x1<0 || x1>=4 || y1<0 || y1>=n1) continue;
        if(used[x1][y1]) continue;
        v.push_back({x1, y1});
        used[x1][y1]=1;
        if(x1==3 && y1==n1-1){
            w.push_back(v);
        }else{
            dfs(v);
        }
        used[x1][y1]=0;
        v.pop_back();
    }
}
vector<int> state;
vector<vector<ll>> mat;
vector<int> v0, v1;
void calc(){
    used[0][0]=1;
    vector<P> vs(1, P(0, 0));
    dfs(vs);
    int c[6000][n1];
    for(int l=0; l<w.size(); l++){
        auto v=w[l];
        int a[4][n1]={}, b[4][n1]={}, s[4][n1]={};
        for(int i=0; i<v.size(); i++){
            a[v[i].first][v[i].second]=i+1;
        }
        unionfind uf(4*n1);
        for(int i=0; i<n1; i++){
            for(int j=0; j<4; j++){
                for(int k=0; k<4; k++){
                    int x=j+dx[k], y=i+dy[k];
                    if(x<0 || x>=4 || y<0 || y>=n1) continue;
                    if(a[j][i] && a[x][y] && (abs(a[x][y]-a[j][i])==1 || abs(a[x][y]-a[j][i])==v.size()-1)){
                        b[j][i]^=(1<<k);
                    }
                }
            }
            for(int j=0; j<3; j++){
                if(b[j][i]&1){
                    uf.unite(i*4+j, i*4+j+1);
                }
            }
            for(int j=0; j<4; j++){
                if(b[j][i]&8){
                    uf.unite(i*4+j, (i-1)*4+j);
                }
            }
            map<int, int> mp;
            int k=0;
            for(int j=0; j<4; j++){
                if(!a[j][i]) continue;
                int r=uf.find(i*4+j);
                if(mp.find(r)==mp.end()){
                    s[j][i]=k;
                    mp[r]=k;
                    k++;
                }else{
                    s[j][i]=mp[r];
                }
            }
            c[l][i]=0;
            for(int j=0; j<4; j++){
                s[j][i]=s[j][i]*16+b[j][i];
                c[l][i]^=(s[j][i]<<(6*j));
            }
            state.push_back(c[l][i]);
        }
    }
    sort(state.begin(), state.end());
    state.erase(unique(state.begin(), state.end()), state.end());
    int m=state.size();
    mat.resize(m);
    for(int i=0; i<m; i++) mat[i].resize(m);
    v0.resize(m); v1.resize(m);
    for(int i=0; i<w.size(); i++){
        for(int j=0; j<n1; j++){
            c[i][j]=lower_bound(state.begin(), state.end(), c[i][j])-state.begin();
        }
        v0[c[i][0]]|=1, v1[c[i][n1-1]]|=1;
        for(int j=0; j<n1-1; j++){
            mat[c[i][j]][c[i][j+1]]|=1;
        }
    }
}
int main()
{
    ll n;
    cin>>n;
  if(n==1){
    cout<<8<<endl;
    return 0;
  }
    calc();
    int m=state.size();
    auto matp=matrixpow(m, mat, n);
    ll ans=0;
    for(int i=0; i<m; i++){
        if(!v0[i]) continue;
        for(int j=0; j<m; j++){
            if(!v1[j]) continue;
            (ans+=matp[i][j])%=MOD;
        }
    }
    cout<<ans<<endl;
	return 0;
}