#include<bits/stdc++.h>
using namespace std;
 
/// ----------------------------- (Debug) ------------------------------
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; }; sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0); sim > char dud(...);
struct debug {
#ifndef ONLINE_JUDGE
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i));}
sim, class b dor(pair < b, c > d) {ris << "(" << d.first << ", " << d.second << ")";}
sim dor(rge<c> d) {*this << "["; for (auto it = d.b; it != d.e; ++it) *this << ", " + 2 * (it == d.b) << *it; ris << "]";}
#else
sim dor(const c&) { ris; }
#endif
};
vector<char*> tokenizer(const char* args) {
    char *token = new char[111]; strcpy(token, args); token = strtok(token, ", ");
    vector<char*> v({token});
    while(token = strtok(NULL,", ")) v.push_back(token);
    return reverse(v.begin(), v.end()), v;
}
void debugg(vector<char*> args) { cerr << "\b\b "; }
template <typename Head, typename... Tail>
void debugg(vector<char*> args, Head H, Tail... T) {
    debug() << " [" << args.back() << ": " << H << "] ";
    args.pop_back(); debugg(args, T...);
}
#define harg(...) #__VA_ARGS__
#ifndef ONLINE_JUDGE
#define dbg(...) { debugg(tokenizer(harg(__VA_ARGS__, \b\t-->Line)), __VA_ARGS__, __LINE__); cerr << endl;}
#else
#define dbg(...) { }
#endif
/// -----------------------------------------------------------------------
 
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef vector<pi> vpi; 
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)    
#define F first
#define S second
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define REP(i,a,b) for(i=a;i<=b;i++)
#define RAP(i,a,b) for(i=a;i>=b;i--)
#define spa <<" "<<
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)x.size()
// ll mod=1e9+7;
const int MX=0x3f3f3f3f;


const ll Maxn = 5e5+1, Mod = 1e9 + 7;
    ll fact[Maxn];

    template<typename T, typename T1>
    T mod(T x, T1 p) {
        x %= p;
        if (x < 0)
            x += p;
        return x;
    }
    // x must be relatively prime to p
    ll inv[Maxn], ifact[Maxn];
     
    // x must be relatively prime to p
    template<typename T>
    T inverse(T x, T p) {
        x = mod(x, p);
        if (x == 1)
            return x;
        return mod((1LL * (-p / x) * (inv[p % x] % p)) , p); 
        // Since inverse of p % x is already calculated.
    }
    ll NcR(ll n, ll r) {
        ll ret = (ifact[n - r] * ifact[r]) % Mod ;
        ret = ( ret * fact[n]) % Mod;
        return ret;
    }

int main(){
    IOS;

    fact[0] = 1;
        for(int i = 1; i < Maxn; i++) {
            fact[i] = fact[i - 1] * i % Mod;
        }
        ifact[0] = 1;
        for(ll i = 1; i < Maxn; i++) {
            inv[i] = inverse(i, Mod);
            ifact[i] = (ifact[i - 1] * inv[i]) % Mod;
        }
    int s,i=1;
    cin>>s;
    ll ans=0;
    while(i*3<=s){
        ans+=NcR(s-2*i-1,i-1);
        ans%=Mod;
        // dbg(ans,i,s-2*i-1);
        i++;
    }
    cout<<ans;
    return 0;
}

Measured memory_bytes: 15284