#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}
//n!
ll fact_mod(ll n) {
    ll ret=1; 
    for(ll i=2;i<=n;i++) ret=ret*(i%mod)%mod;
    return ret;
}
 
// 繰り返し二乗法 
ll pow_mod(ll x, ll n){
    if(n==0) return 1;
    ll ret=pow_mod((x*x) % mod, n/2);
    if(n&1) ret=(ret*x)%mod;
    return ret;
}
 
//nCr O(r) nがでかくても安心
ll combination_mod(ll n, ll r) {
    if(r>n-r) r=n-r;
    if(r==0) return 1;
    ll a=1;
    //a=n!/(n-r)!=n~n-r+1までの総積->O(r)
    for(ll i=0;i<r;i++) a=a*((n-i)%mod)%mod;
    //b=inv(r!)
    ll b=pow_mod(fact_mod(r), mod-2);
    return (a%mod)*(b%mod)%mod;
}
 
ll inv_mod(ll n){
    // フェルマーの小定理
    return pow_mod(n,mod-2);
}

ll f(ll a0,ll ko){
    ll ret=0;
    ret+=3*ko%mod*(ko+1)%mod*inv_mod(2)%mod;
    a0=a0-3;
    if(a0<0) a0+=mod;
    ret+=a0*ko%mod;
    return ret%mod;
}

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

    ll n;cin>>n;
    ll m=n-4;
    m%=mod;
    ll ans=((m+3)/3)%mod;
    ll k=ans;
    if(m%3==1){
        ans+=f(0,(k+1)/2);ans%=mod;
        ans+=f(2,k/2);ans%=mod;
    }
    else if(m%3==0){
        ans+=f(0,(k+1)/2);ans%=mod;
        ans+=f(1,k/2);ans%=mod;
    }
    else{
        ans+=f(1,(k+1)/2);ans%=mod;
        ans+=f(2,k/2);ans%=mod;
    }
    cout<<ans<<endl;
    return 0;
}