//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
const ll mod=1e9+7;
ll dp[1001000];
vector<int> vd[1001000];
int vis[1001000];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	dp[1]=1;
	for(int i=1;i<=n;i++)
		for(int j=i;j<=n;j+=i)
			vd[j].pb(i);
	for(int i=3;i<=n;i++)
	{
		vector<int> vv;
		for(int j=i-2;j<=i;j++)
			for(auto x:vd[j])
				vv.pb(x);
		for(auto x:vv) if(x<i-1)
		{
			if(!vis[x]) vis[x]=1;
			else continue;
			dp[i-1]=(dp[i-1]+dp[x])%mod;
		}
		for(auto x:vv) vis[x]=0;
	}
	ll ans=accumulate(dp+1,dp+n+1,0ll)%mod;
	cout<<ans*n%mod<<endl;
	return 0;
}