n = int(input())
def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]]
a = primes(2*(n + 1))
#print(a)
now = 1
res = 1
mod = 998244353
res = 1
for i in range(len(a)):
    if a[i + 1] > n:
        break
    b = 1
    if a[i] > n:
        break
    while b * a[i] <= n:
        b *= a[i]
    res *= int(b)
    res %= mod
    if now == n - 1:
        break
print(res)