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

#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=INF;
const ll MAX=100010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;

ll rui(ll a,ll b){
    ll res=1;
    ll x=a;
    while(b){
        if(b&1)res=res*x%mod;
        x=x*x%mod;
        b/=2;
    }
    return res;
}

void solve(){
    ll n;cin>>n;
    vector<vector<ll> >dp(n+1,vector<ll>(16));
    if(n<=3){
        cout<<0<<endl;
        return ;
    }
    rep(i,16)dp[0][i]=1;
    dp[0][10]=0;
    ll ans=rui(2,n-4);
    rep(i,n-4){
        ll y=rui(2,n-4-i-1)%mod;
        rep(j,16){
            ll x=(j*2)%16;
            if(x==10)ans=(ans+dp[i][j]*y%mod)%mod;
            else dp[i+1][x]=(dp[i+1][x]+dp[i][j])%mod;
            x++;
            dp[i+1][x]=(dp[i+1][x]+dp[i][j])%mod;
        }
    }
    cout<<ans<<endl;
}

signed main(){
    //cin.tie(0);
    //ios::sync_with_stdio(false);
    solve();
}