from collections import defaultdict
from functools import lru_cache
import sys
sys.setrecursionlimit(50000000)

def prime_list(n):
    is_prime = [0] * (n + 1) #素数かどうか。1なら素数。
    is_prime[2] = 1
    for i in range(3, n + 1, 2):
        is_prime[i] = 1
    for i in range(2, int(n ** 0.5) + 1):
        if is_prime[i]:
            for j in range(i * i, n + 1, 2 * i):
                is_prime[j] = 0
    #最後に全部並べる。
    d = []
    for j in range(n + 1):
        if is_prime[j] == 1:
            d.append(j)
    return d, is_prime


def main():
    dic = defaultdict(list)
    MAX = pow(10,5) + 100
    L,dummy = prime_list(MAX)
    for i in L:
        a = i
        while a <= MAX:
            dic[a].append(i)
            a += i
    #print(dic)
    M = int(input()); MOD = pow(10,9) + 7
    @lru_cache(maxsize=None)
    def solve(p,dic=dic,MOD=MOD):
        if p == 1:
            return 1
        if p == 2:
            return 2
        ret = solve(p-1)
        #print(p,ret)
        n = len(dic[p])
        #print(dic[p])
        for i in range(1,1<<n):
            val = 1
            ppcnt = 0
            for j in range(n):
                if (i>>j)&1 == 1:
                    val *= dic[p][j]
                    ppcnt += 1
            if ppcnt%2 == 1:
                ret += solve(p//val)
            else:
                ret -= solve(p//val)
            ret %= MOD

        return ret%MOD
    
    print(solve(M)%MOD)

if __name__ == '__main__':
    main()