import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
def 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]
from math import gcd
def lcm(x, y):
    return x // gcd(x, y) * y
n = ni()

mod = 998244353
f = divisors(n)
d = {x:i for i, x in enumerate(f)}


m = len(f)

dp = [0] * m

dp[0] = 1

for i in range(m):
    for j in range(m):
        x = lcm(f[i], f[j])
        if f[i] != x:
            dp[d[x]] += dp[i]
            dp[d[x]] %= mod
print(dp[-1])