#include <bits/stdc++.h>
using namespace std;
const int mod = (int)1e9+7;
int dp[1000005];
signed main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    if(n==1){
        cout << "1\n";
        return 0;
    }
    dp[2] = 1;
    //dp[i] represents number of solutions where you start building from (i-1,i)
    //starting from (1,2)
    //answer for n is the sum of number of ways to build from (i-1,i)
    //how to build from i-1, i
    //you can go from i-1,i to j-1,j if 
    //j-1,i-1 is good, j,i, is good, j,j-1 is good, or j-1,i is good
    //each of those options, add to answer
    // j-1, j -> i-1, i

    dp[3] = 1;
    dp[4] = 2;
    /*
    (2,3) -> 1
    (1,2) -> 1
    (3,4) -> 2
    4 1 3 2
    4 2 3 1
    3 2 1
    5 4


    (3,4) -> (3,5) -> (6,5)
    (2,3) -> (3,4) -> (3,5) -> (6,5)

    (4,5) -> (6,5)
    */


   // dp[5] = 4;
    for(int i = 5; i<=n; i++){
        dp[i] = 2;
    }
    for(int i = 4; i<=n; i++){

        for(int j = (i-1)*2; j<=n; j+=i-1){
            dp[j+1]+=dp[i];
            dp[j+2]+=dp[i];
            dp[j]+=dp[i];
            dp[j+1]%=mod;
            dp[j+2]%=mod;
            dp[j]%=mod;
        }
        dp[i+1]+=dp[i];
        dp[i+1]%=mod;
    }
    long long ans = 0;
    for(int i = 2; i<=n; i++){
        ans+=dp[i];
        ans%=mod;
    }
    cout << ans*n%mod << '\n';
    return 0;
}