#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
ll x;
ll modpow(ll x,ll n){
	ll res=1;
	while(n>0){
		if(n&1) res=res*x%mod;
		x=x*x%mod;
		n>>=1;
	}
	return res;
}
int main(){
	cin >> x;
	if(x <= 3) cout << 0 << endl;
	else{
		x --;
		ll all = 1, ans = 0;
		for(int i=1;i<=2;i++) all = all*((x-i)%mod)%mod;
		all = all*modpow(2ll,mod-2)%mod;
		if(x%3 == 0) {all --; ans++; }
		ll num = (x-1)/2;
		if(x%3 == 0) { num--; }
		all -= num*3LL%mod; ans += num;
		ans += all%mod*modpow(6LL,mod-2)%mod;
		cout << (ans%mod+mod)%mod << endl;
	}
}