#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<climits>
#include<iostream>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<list>
#include<map>
#include<set>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
 
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)

ll n;

ll dp[1 << 20][3];
ll mod = 1e9+7;

int main(){
    cin >> n;

    dp[0][0] = 1;

    REP(i,n) {
        REP(j,3) {
            if(j != 2) {
                (dp[i + 1][j + 1] += dp[i][j]) %= mod;
            }
            if(j != 0) {
                (dp[i + 1][0] += dp[i][j]) %= mod;
            }
        }
    }
    ll ans = 0;
    REP(i,3) {
        (ans += dp[n][i]) %= mod;
    }
    cout << ans << endl;
    return 0;
}