mod = 10**9+7
def f(n, i):
    res = 0
    while n:
        res += n%i
        n //= i
    return res

U = 10**6
n = int(input())
ans = 0
if n <= U:
    for i in range(2, n+1):
        ans += f(n, i)
        ans %= mod
    print(ans)
    exit()
for i in range(2, U+1):
    ans += f(n, i)
    ans %= mod
for k in range(1, U):
    left = max(U, n//(k+1))+1
    right = n // k
    if right < left:
        continue
    cnt = right - left + 1
    ans += cnt * k
    ans %= mod
    a = n%left
    b = n%right
    ans += (a+b)*cnt//2
    ans %= mod
print(ans)