#include <bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef long double ld ;
typedef pair<ll,ll> P ;
typedef tuple<bool,ll,ll,ll> TP ;
#define chmin(a,b) a = min(a,b)
#define chmax(a,b) a = max(a,b)
#define bit_count(x) __builtin_popcountll(x)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a / gcd(a,b) * b
#define rep(i,n) for(int i = 0 ; i < n ; i++)
#define rrep(i,a,b) for(int i = a ; i < b ; i++)
#define endl "\n"

const int mod = 1000000007 ;

ll powmod(ll x , ll n){
    ll res = 1 ;
    while(n > 0){
        if(n & 1) (res *= x) %= mod ;
        (x *= x) %= mod ;
        n >>= 1 ;
    }
    return res ;
}

ll n ;
ll dp[101010][2][2][2] ;

int main(){
    cin >> n ;
    if(n <= 3){
        cout << 0 << endl ;
        return 0 ;
    }
    rep(i,2) rep(j,2) rep(k,2) dp[3][i][j][k] = 1 ;
    rrep(a,3,n){
        rep(i,2) rep(j,2) rep(k,2) rep(l,2){
            if(i == 1 && j == 0 && k == 1 && l == 0) continue ;
            (dp[a+1][i][j][k] += dp[a][j][k][l]) %= mod ;
        }
    }
    ll sum = 0 ;
    rep(i,2) rep(j,2) rep(k,2) (sum += dp[n][i][j][k]) %= mod ;
    cout << (powmod(2,n) - sum + mod) % mod << endl ;
}