mod = 10 ** 9 + 7

n = int(input())
def s1(n):
    rv = 0
    i = 1
    while i <= n:
        v = n // i
        ni = n // v + 1
        rv += (ni - i) * v
        i = ni
    return rv
cnt1 = s1(n)

def s2(n):
    rv = 0
    i = 1
    while i <= n:
        v = n // i
        ni = n // v + 1
        rv += (ni - i) * v * v % mod
        i = ni
    return rv
cnt2 = s2(n)

# (a,b,c) s.t. a|b|c<=n corresponds to (x,y,z) s.t. xyz <= n

def s3(n):
    rv = 0
    i = 1
    while i <= n:
        v = n // i
        ni = n // v + 1
        rv += (ni - i) * s1(v) % mod
        i = ni
    return rv
cnt3 = s3(n)
ans = n * cnt1 - cnt2 - cnt3 + cnt1
ans -= n * n - 2 * cnt1 + n
print(ans % mod)