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]

def factorization(n):
    arr = dict()
    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[i]=cnt

    if temp!=1:
        arr[temp]=1

    if len(arr)==0:
        arr[n]=1

    return arr

MOD = 998244353
N = int(input())
Y = make_divisors(N)
F = []
for y in Y:
    F.append(factorization(y))
dp = [0 for _ in range(len(Y))]
dp[0] = 1
for i in range(len((Y))):
    for j in range(i+1, len(Y)):
        #Y[i] -> Y[j]
        temp = dp[i]
        for p in F[i]:
            if p==1:
                continue
            if p not in F[j]:
                temp=0
                break
            else:
                ej = F[j][p]
                ei = F[i][p]
                if ei>ej:
                    temp=0
                    break
                elif ei==ej:
                    temp=temp*(ej+1)%MOD
        dp[j] = (dp[j]+temp)%MOD
print(dp[-1])