import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**9
# md = 998244353
md = 10**9+7

def base(b):
    res = 0
    a = n
    while a:
        a, r = divmod(a, b)
        res += r
    return res

n = II()

ans = 0
last = -1
for b in range(2, n+1):
    last = b
    if b**2 > n: break
    ans += base(b)
    ans %= md

for p in range(n//last, 0, -1):
    l, r = n//(p+1), n//p
    m = r-l
    a = n-p*r
    ans += p*m%md+(2*a+(m-1)*p)*m//2%md
    ans %= md

print(ans)