import math
n = int(input())
mod = 998244353

divs = set()
for i in range(1,int(n**0.5)+1):
    if n%i:
        continue
    divs.add(i)
    divs.add(n//i)

divs = sorted(divs)
le = len(divs)
pos = {d:i for i,d in enumerate(divs)}
divides = [[] for i in range(le)]
for i,d in enumerate(divs):
    for j,nd in enumerate(divs):
        lcm = d*nd // math.gcd(d,nd)
        if lcm > d:
            divides[i].append(pos[lcm])
# print(divides,divs)
# print("here")
dp = [0]*le
dp[0] = 1
ans = 0
for i in range(40):
    ndp = [0]*le
    for j in range(le):
        if dp[j] == 0:
            continue
        for nj in divides[j]:
            ndp[nj] += dp[j]
            ndp[nj] %= mod
    
    dp = ndp
    ans += dp[-1]
    ans %= mod
    # print(dp)
print(ans)