from collections import defaultdict,deque
import math
import heapq
mod=998244353
n=int(input())
S=set()
i=1
while i*i<=n:
  if n%i==0:
    S.add(i)
    S.add(n//i)
  i+=1
LS=sorted(S)

d=defaultdict(int)
d[(1,1)]=1
ans=0
#q=deque([(1,1)])
heap=[]
heapq.heappush(heap,(1,1))
H=set()
while heap:
#  print(heap)
  xi,ai=heapq.heappop(heap)
  for e in LS:
    tmp=ai*e//math.gcd(ai,e)
    if xi<tmp:
      if tmp==n:
        ans+=d[(xi,ai)]
        ans%=mod
      else:
        if (tmp,e) not in S:
          S.add((tmp,e))
          heapq.heappush(heap,(tmp,e))
        d[(tmp,e)]+=d[(xi,ai)]
#  print(d)
print(ans)