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**16
# md = 998244353
md = 10**9+7

# nまで自然数の約数を全列挙する
def factors_all(n):
    res = [[1] for _ in range(n+1)]
    for f in range(2, n):
        if f*2 > n:
            for i in range(f, n+1): res[i].append(i)
            break
        for i in range(f, n+1, f): res[i].append(f)
    return res

m = II()
dp = [0]*(m+1)
dp[0] = 1
ff = factors_all(m)
for i in range(1, m+1):
    for f in ff[i]:
        dp[i] += dp[i//f-1]
    dp[i] %= md
print(dp[m])