#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL mod=1e9+7;
int main() {
    int n;cin>>n;
    vector<LL> ken(n+2,0),pa(n+2,0);
    pa[0]=1;
    for(int i = 0; i < n; i++){
        pa[i+1]+=ken[i];pa[i+1]%=mod;
        ken[i+1]+=pa[i];ken[i+1]%=mod;
        ken[i+2]+=pa[i];ken[i+2]%=mod;
    }
    cout<<(ken[n]+pa[n])%mod<<endl;
    return 0;
}