def make_divisors(n):
    divisors = []
    f = 1
    while f * f <= n:
        if n % f == 0:
            divisors.append(f)
            if f != n // f:
                divisors.append(n // f)
        f += 1
    return divisors

m = int(input())
mod = 10**9 + 7

DP = [0 for _ in range(m + 1)]
DP[0] = 1
for n in range(1, m + 1):
    D = make_divisors(n)
    for i in D:
        DP[n] += DP[n // i - 1]
        DP[n] %= mod
print(DP[m])