/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.11.03 19:24:46
 **/

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;

template < int MOD >
struct mint {
public:
    long long x;
    mint(long long x = 0) : x((x % MOD + MOD) % MOD) {}
    mint(std::string& s) {
        long long z = 0;
        for (int i = 0; i < s.size(); i++) {
            z *= 10;
            z += s[i] - '0';
            z %= MOD;
        }
        this->x = z;
    }
    mint& operator+=(const mint& a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator-=(const mint& a) {
        if ((x += MOD - a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator*=(const mint& a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    mint& operator/=(const mint& a) {
        long long n = MOD - 2;
        mint u = 1, b = a;
        while (n > 0) {
            if (n & 1) {
                u *= b;
            }
            b *= b;
            n >>= 1;
        }
        return *this *= u;
    }
    mint operator+(const mint& a) const {
        mint res(*this);
        return res += a;
    }
    mint operator-() const {
        return mint() -= *this;
    }
    mint operator-(const mint& a) const {
        mint res(*this);
        return res -= a;
    }
    mint operator*(const mint& a) const {
        mint res(*this);
        return res *= a;
    }
    mint operator/(const mint& a) const {
        mint res(*this);
        return res /= a;
    }
    friend std::ostream& operator<<(std::ostream& os, const mint& n) {
        return os << n.x;
    }
    friend std::istream& operator>>(std::istream& is, mint& n) {
        long long x;
        is >> x;
        n = mint(x);
        return is;
    }
    bool operator==(const mint& a) const {
        return this->x == a.x;
    }
    bool operator!=(const mint& a) const {
        return this->x != a.x;
    }
    mint pow(long long k) const {
        mint ret = 1;
        mint p = this->x;
        while (k > 0) {
            if (k & 1) {
                ret *= p;
            }
            p *= p;
            k >>= 1;
        }
        return ret;
    }
};
constexpr int MOD = 1e9 + 7;
template < typename T >
vector< pair< pair< T, T >, T > > quotient_range(T N) {
    T M;
    vector< pair< pair< T, T >, T > > ret;
    for (M = 1; M * M <= N; M++) {
        ret.emplace_back(make_pair(M, M), N / M);
    }
    for (T i = M; i >= 1; i--) {
        T L = N / (i + 1) + 1;
        T R = N / i;
        if (L <= R && ret.back().first.second < L) ret.emplace_back(make_pair(L, R), N / L);
    }
    return ret;
}
mint< MOD > floor_sum(ll N) {
    auto v = quotient_range(N);
    mint< MOD > ans = 0;
    for (auto p : v) {
        ans += mint< MOD >(p.second) * (p.first.second - p.first.first + 1);
    }
    return ans;
}
mint< MOD > floor_sum2(ll N) {
    auto v = quotient_range(N);
    mint< MOD > ans = 0;
    for (auto p : v) {
        ans += mint< MOD >(p.second) * p.second * (p.first.second - p.first.first + 1);
    }
    return ans;
}

int main() {
    int n;
    cin >> n;
    mint< MOD > ans = 0;

    ans += floor_sum(n) - n;
    ans *= n - 2;

    ans -= floor_sum2(n) - floor_sum(n) * 3 + 2 * n;

    for (auto p : quotient_range(n)) {
        ans -= (floor_sum(p.second) - p.second * 2 + 1) * (p.first.second - p.first.first + 1);
    }
    cout << ans << endl;
    return 0;
}