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