from math import isqrt,lcm
n = int(input())
mod = 998244353
dn = set(n)
for i in range(2,isqrt(n)+1):
    dn.add(i); dn.add(n//i)
dn = sorted(dn)
dp = {v:1 for v in dn}
for u in dn:
    for v in dn:
        if u%v==0: continue
        l = lcm(u,v)
        dp[l] = (dp[l]+dp[u])%mod
print(dp[n])