import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# md = 10**9+7
md = 998244353

def prime_factorization(a):
    pp, ee = [], []
    if a & 1 == 0:
        pp += [2]
        ee += [0]
        while a & 1 == 0:
            a >>= 1
            ee[-1] += 1
    p = 3
    while p**2 <= a:
        if a%p == 0:
            pp += [p]
            ee += [0]
            while a%p == 0:
                a //= p
                ee[-1] += 1
        p += 2
    if a > 1:
        pp += [a]
        ee += [1]
    return pp, ee

n=II()
pp,ee=prime_factorization(n)

ss=[]
def dfs(i,arr):
    if i==len(pp):
        ss.append(arr)
        return
    for e in range(ee[i]+1):
        dfs(i+1,arr+[e])

dfs(0,[])

ia=[]
for i,s in enumerate(ss):
    a=1
    for p,e in zip(pp,s):a*=p**e
    ia.append((i,a))

ia.sort(key=lambda x:x[1])
dp=[0]*len(ia)
dp[0]=1
for i,a in ia:
    for j in range(i):
        c=1
        for e,f in zip(ss[j],ss[i]):
            if e>f:
                c=0
                break
            if e==f:
                c*=e+1
                c%=md
        dp[i]+=dp[j]*c%md
        dp[i]%=md

print(dp[-1])