import sys
input = sys.stdin.readline
n=int(input())
mod=998244353
l=[]
sn=int(n**0.5)+5
for i in range(1,sn):
  if i*i>n:
    break
  if n%i==0:
    l.append(i)
    if n//i!=i:
      l.append(n//i)
l.sort()
dp=[1]*len(l)
import math
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr
fac=factorization(n)
f=[]
for i,j in fac:
  f.append(i)
yaku=[[] for _ in range(len(l))]
for i in range(1,len(l)):
  now=l[i]
  for j in f:
    num=0
    while now%j==0:
      num+=1
      now//=j
    yaku[i].append(num)
for i in range(1,len(l)):
  for j in range(i+1,len(l)):
    if l[j]%l[i]==0:
      val=1
      for k in range(len(f)):
        if yaku[i][k]==yaku[j][k]:
          val*=(1+yaku[j][k])
      dp[j]+=(dp[i]*val)
      dp[j]%=mod
print(dp[-1])