m = int(input())
def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]
l = [1]
mod = 10 ** 9 + 7
for i in range(1, 10 ** 5 + 1):
    l.append(sum(l[d - 1] for d in make_divisors(i)) % mod)
print(l[m])