#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>

using namespace std;

typedef long long ll;
const ll MOD = 1000000007;

const int N_MAX = 10;

ll inv[N_MAX],fac[N_MAX],finv[N_MAX];

void init(){
    fac[0]=fac[1]=1;
    finv[0]=finv[1]=1;
    inv[1]=1;
    for(int i=2;i<N_MAX;i++){
        inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;
        fac[i]=fac[i-1]*(ll) i%MOD;
        finv[i]=finv[i-1]*inv[i]%MOD;
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll N;
    cin >> N;
    N -= 4;
    init();
    ll ans = 0;
    ll k = N/6;
    k %= MOD;
    ll M = N-3;
    ll p = M/6;
    ll l = N/2+1;
    ll r = (N-k*6)/2+1;
    l %= MOD;
    r %= MOD;
    //cout << l << ' ' << r << endl;
    k %= MOD;
    p %= MOD;
    ans += (((l+r)*(k+1))%MOD)*inv[2];
    ans %= MOD;
    if(M >= 0){
        l = M/2+1;
        r = (M-p*6)/2+1;
        l %= MOD;
        r %= MOD;
        //cout << l << ' ' << r << endl;
        ans += (((l+r)*(p+1))%MOD)*inv[2];
        ans %= MOD;
    }
    cout << ans << endl;
}