from math import gcd

mod = 998244353
N = int(input())

# @LorseKudos(TechTrain) / 約数を高速で列挙するコード(Python)
# https://qiita.com/LorseKudos/items/9eb560494862c8b4eb56
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]

L = make_divisors(N)
# print(len(L))

def lcm(a, b):
    g = gcd(a,b)
    return a * b // g

DP = {}
for x in L:
    DP[x] = 0
DP[1] = 1

for x in L:
    for y in L:
        z = lcm(x, y)
        if z <= x: continue
        DP[z] = (DP[z] + DP[x]) % mod

print(DP[N])