#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <cassert>
using namespace std;

#define GET_ARG(a,b,c,F,...) F
#define REP3(i,s,e) for (i = s; i <= e; i++)
#define REP2(i,n) REP3 (i,0,(int)(n)-1)
#define REP(...) GET_ARG (__VA_ARGS__,REP3,REP2) (__VA_ARGS__)
#define RREP3(i,s,e) for (i = s; i >= e; i--)
#define RREP2(i,n) RREP3 (i,(int)(n)-1,0)
#define RREP(...) GET_ARG (__VA_ARGS__,RREP3,RREP2) (__VA_ARGS__)
#define DEBUG(x) cerr << #x ": " << x << endl

const int MOD = 1e9+7;

int dp[1000002][4];

int main(void) {
    int i, j, k, n;
    cin >> n;
    dp[0][0] = 1;
    REP (i,n) REP (j,4) REP (k,1,3) if (j != k) dp[i+k][k] = (dp[i+k][k] + dp[i][j]) % MOD;
    int ans = 0;
    REP (j,1,3) ans = (ans + dp[n][j]) % MOD;
    cout << ans << endl;
    return 0;
}