#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr ll MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;

/*繰り返し二乗法*/
long long modpow(long long x, long long n) {
    long long ret = 1;
    while (n > 0) {
        if (n & 1) ret = (ret * x) % MOD;  
        x = (x * x) % MOD;
        n >>= 1;  
    }
    return ret;
}


/*繰り返し二乗法でxのmod逆元を取る*/
long long inverse(long long x){
    return modpow(x,MOD-2);
}

int main(){
    ll n;
    cin >> n;
    ll ans = 0;
    ll inv2 = inverse(2);
    ll inv6 = inverse(6);
    if(((n-4)%3)==0){
        ll one = 1;
        ll same = ((n-4)/2) % MOD;
        ll C = (((((n-2)%MOD) * ((n-3)%MOD))%MOD) * inv2)%MOD;
        ll pow = (C - ((3*same)%MOD) - one + 2*MOD)%MOD;
        pow = (pow * inv6)%MOD;
        ans = (pow + one + same)%MOD;
    }else{
        ll one = 0;
        ll same = ((n-4)/2 + 1) % MOD; 
        ll C = (((((n-2)%MOD) * ((n-3)%MOD))%MOD) * inv2)%MOD;
        ll pow = (C - ((3*same)%MOD) - one + 2*MOD)%MOD;
        pow = (pow * inv6)%MOD;
        ans = (pow + same + one)%MOD;
    }
    cout << ans << endl;
    return 0;
}