#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

const ll MOD = 1000000007;

// DPの更新
vector<ll> matmul(vector<ll> &dp, vector<vector<ll>> &mt, int m){
    vector<ll> ret(m,0);
    rep(i,m){
        rep(j,m){
            ret[i] += mt[i][j] * dp[j] % MOD;
            ret[i] %= MOD;
        }
    }
    return ret;
}
// 遷移行列の更新
vector<vector<ll>> update_matmul(vector<vector<ll>> &mt, int m){
    vector<vector<ll>> ret(m, vector<ll>(m,0));
    rep(i,m){
        rep(j,m){
            rep(k,m){
                ret[i][j] += mt[i][k] * mt[k][j] % MOD;
                ret[i][j] %= MOD;
            }
        }
    }
    return ret;
}

void matpow(vector<ll> &dp, vector<vector<ll>> &mt, int m, ll k){
    while(k){
        if(k & 1) dp = matmul(dp, mt, m);
        mt = update_matmul(mt, m);
        k /= 2;
    }
}


int main() {
    ll M, K; // M:行列のサイズ K:累乗回数
    M = 4;
    cin >> K;

    vector<ll> dp(M);
    rep(i,M) dp[i] = 0;
    dp[0] = 1;
    vector<vector<ll>> mt(M,vector<ll>(M));
    rep(i,M)rep(j,M)mt[i][j] = 0;

    rep(i,4){
        rep(j,4){
            if(i!=j) mt[i][j] = 1;
        }
    }

    matpow(dp, mt, M, K);

    ll ans = dp[0];

    cout << ans << endl;
    return 0;
}