import math

def lcm(x, y):
  return x * y // math.gcd(x, y)

n = int(input())
mod = 998244353
ls = []
t = 1
while t ** 2 <= n:
  if n % t == 0:
    ls.append(t)
    ls.append(n//t)
  t += 1
ls = sorted(list(set(ls)))
dp = dict()
for v in ls:
  dp[v] = 0
dp[1] = 1
for v1 in ls:
  for v2 in ls:
    if lcm(v1, v2) == v1:
      continue
    dp[lcm(v1, v2)] += dp[v1]
    dp[lcm(v1, v2)] %= mod
print(dp[n])