import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
from math import sqrt, gcd, factorial
# from math import isqrt, prod,comb  # python3.8用(notpypy)
#from bisect import bisect_left,bisect_right
from functools import lru_cache, reduce
#from heapq import heappush,heappop,heapify,heappushpop,heapreplace
#import numpy as np
#import networkx as nx
#from networkx.utils import UnionFind
#from numba import njit, b1, i1, i4, i8, f8
#from scipy.sparse import csr_matrix
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError
# numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k  # n/kの切り上げを返す
def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)


def divisorlist(n):
    a, b = [], []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            a.append(i)
            b.append(n//i)
    if a[-1] == b[-1]:
        a.pop()
    return a+b[::-1]


def main():
    mod = 10**9+7
    mod2 = 998244353

    solve = [0]*(10**5+5)
    solve[0] = 1
    for m in range(1, 10**5+3):
        for div in divisorlist(m):
            solve[m] += solve[m//div-1]
        solve[m] %= mod
    print(solve[int(input())])


if __name__ == '__main__':
    main()