import sys
import math
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for _ in range(N)]
            
def main():
    n=int(input())
    c=dict()
    while(n > 1):
        find = False
        v = 2
        while v*v<=n:
            if n%v==0:
                find=True
                c[v]=c.get(v,0)+1
                n//=v
                break
            v+=1
        if find==False:
            c[n]=c.get(n,0)+1
            break
    a=list(c.values())

    def getind(b):
        res=0
        for i in range(len(a)):
            res*=a[i]+1
            res+=b[i]
        return res
    dp = [0]*(getind(a)+1)
    dp[0]=1
    def solve2(i,b,bb):
        if i==len(a):
            ib = getind(b)
            ibb = getind(bb)
            if ib==ibb:return
            add=dp[ib]
            for i in range(len(b)):
                if b[i]==bb[i]:add*=b[i]+1
            dp[ibb]+=add
            dp[ibb]%=998244353
            return
        for j in range(b[i],a[i]+1):
            bb[i]=j
            solve2(i+1,b,bb)

    def solve(i,b):
        if i==len(a):
            solve2(0,b,list(b))
            return
        for j in range(a[i]+1):
            b[i]=j
            solve(i+1,b)
    solve(0,[0]*len(a))
    print(dp[-1])
        
if __name__ == "__main__":
    main()