#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}






//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	ll ans=16;
	int N;
	cin>>N;
	if(N<4){
		cout<<0<<"\n";
		return 0;
	}
	vector<ll> dp(16,1);
	dp[10]=0;
	rep(i,N-4){
		ans*=2ll;
		ans%=mod;
		vector<ll> n_dp(16);
		rep(j,16){
			dp[j]%=mod;
			n_dp[j/2+8]+=dp[j];
			n_dp[j/2]+=dp[j];
		}
		swap(n_dp,dp);
		dp[10]=0;
	}
	rep(j,16) ans-=dp[j];
	cout<<(ans%mod+mod)%mod<<"\n";
}