def Divisors(N):
    N=abs(N)
    L,U=[],[]
    k=1
    while k*k <=N:
        if N%k== 0:
            L.append(k)
            if k*k!=N:
                U.append(N//k)
        k+=1
    return L+U[::-1]
#==================================================
M=int(input())
Mod=10**9+7

DP=[0]*(M+1)
DP[0]=1

for i in range(1,M+1):
    for j in Divisors(i):
        DP[i]+=DP[i//j-1]
    DP[i]%=Mod

print(DP[M])