#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
int MOD = 1e9 + 7;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n;
    cin >> n;

    int dp[n + 1];
    int kk[n + 1];
    int kp[n + 1];
    int pk[n + 1];

    dp[1] = 1;
    dp[2] = 2;
    dp[3] = 2;

    kk[3] = 0;
    kp[3] = 1;
    pk[3] = 1;

    for(int i = 4; i <= n; i++){
        dp[i] = (dp[i - 1] + pk[i - 1]) % MOD;
        kk[i] = pk[i - 1] % MOD;    //pkk
        kp[i] = (pk[i - 1] + kk[i - 1]) % MOD;    //pkp or kkp  
        pk[i] = kp[i - 1] % MOD;    //kpk
    }
    cout << dp[n] << endl;

    return 0;
}