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