#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i< (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int mod = 1e+9+7;
const int inf = (1<<30);
const ll INF = (1ull<<62);


class mint {
    long long x;
public:
    mint(long long x=0) : x((x%mod+mod)%mod) {}
    mint operator-() const { 
      return mint(-x);
    }
    mint& operator+=(const mint& a) {
        if ((x += a.x) >= mod) x -= mod;
        return *this;
    }
    mint& operator-=(const mint& a) {
        if ((x += mod-a.x) >= mod) x -= mod;
        return *this;
    }
    mint& operator*=(const  mint& a) {
        (x *= a.x) %= mod;
        return *this;
    }
    mint operator+(const mint& a) const {
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint& a) const {
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint& a) const {
        mint res(*this);
        return res*=a;
    }
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }
    // for prime mod
    mint inv() const {
        return pow(mod-2);
    }
    mint& operator/=(const mint& a) {
        return (*this) *= a.inv();
    }
    mint operator/(const mint& a) const {
        mint res(*this);
        return res/=a;
    }

    friend ostream& operator<<(ostream& os, const mint& m){
        os << m.x;
        return os;
    }
};


int main(){
    int n; cin>>n;
    if(n<=3){
        cout<<0<<endl;
        return 0;
    }
    vector<vector<mint>> dp(n+2,vector<mint>(8));
    rep(i,8) dp[3][i] = 1;
    for(int i = 3; i<n; i++){
        dp[i+1][0] += dp[i][0] + dp[i][4];
        dp[i+1][1] += dp[i][0] + dp[i][4];
        dp[i+1][2] += dp[i][1];
        dp[i+1][3] += dp[i][1] + dp[i][5];
        dp[i+1][4] += dp[i][2] + dp[i][6];
        dp[i+1][5] += dp[i][2] + dp[i][6];
        dp[i+1][6] += dp[i][3] + dp[i][7];
        dp[i+1][7] += dp[i][3] + dp[i][7];
    }
    mint ans = 1;
    rep(i,n) ans *= 2;
    rep(i,8) ans -= dp[n][i];

    cout<<ans<<endl;

}