#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
#define put(n) cout<<(n)<<endl
#define rep(i,N) for(int(i)=0;(i)<(N);++(i))
#define rrep(i,N) for(int (i)=(N-1);(i)>=(0);--(i))
#define all(v) (v).begin() , (v).end()
#define rall(v) (v).rbegin() , (v).rend()
#define pb(n) push_back(n)

int a[1010],b[1010];//,dp[1010][1010];
ll dp[1001000][3];

int main(){
    int N; cin >> N;
    dp[1][1] = 1;
    for(int i=1;i<=N;++i){
        (dp[i][2] += dp[i-1][1]) %= MOD;
        (dp[i][1] += dp[i-1][0]) %= MOD;
        (dp[i][0] += dp[i-1][2] + dp[i-1][1]) %= MOD;
    }
    ll ans = 0;
    rep(i,4) (ans += dp[N][i]) %= MOD;
    cout << ans << endl;  
}