#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n;
    cin >> n;
    ll MOD = 1000000007;
    ll dp[n+1][3];
    srep(i,1,n+1){
        if(i == 1){
            dp[i][0] = 1;
            dp[i][1] = 0;
            dp[i][2] = 0;
        }else{
            dp[i][0] = dp[i-1][2];
            dp[i][1] = dp[i-1][0];
            dp[i][2] = dp[i-1][0] + dp[i-1][1];
        }
        rep(j,3)dp[i][j] %= MOD;
    }
    ll ans = dp[n][0] + dp[n][1] + dp[n][2];
    ans %= MOD;
    cout << ans << endl;
    return 0;
}