#https://qiita.com/LorseKudos/items/9eb560494862c8b4eb56
def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]

from collections import defaultdict
import math
N=int(input())
div=make_divisors(N)  
l=len(div)
dp=[0 for _ in range(l)]
dp[0]=1
dc=defaultdict(int)
for i in range(l):
    count=0
    for j in range(0,i+1):
        if div[i]%div[j]==0:
            count+=1
    dc[div[i]]=count
p=998244353
for i in range(l):
    for j in range(i+1,l):
        if div[j]%div[i]==0:
            dp[j]+=dp[i]*dc[div[i]//(math.gcd(div[j],div[i]))]
            dp[j]%=p
print(dp[-1]%p)