#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define downque(que) priority_queue<ll> que;
#define upque(que) priority_queue<ll, vector<int>, greater<int>> que;
typedef long long ll;
typedef vector<vector<int>> Matrix;
const int MOD = 1e9 + 7;


int main(void){

    int N;
    cin>>N;

    vector<ll> dp(N,0);

    //Use dp, dp[i]=dp[i-2]+dp[i-3];
    dp[0]=1;
    dp[1]=2;
    dp[2]=2;

    FOR(i,3,N){
        dp[i]=dp[i-2]+dp[i-3];
        dp[i]%=MOD;
    }

    cout<<dp[N-1]<<endl;
    return 0;
}