n = int(input())
mod = 998244353

IsPrime = [True for _ in range(n + 1)]
IsPrime[0] = IsPrime[1] = False
PrimeSet = set()
for i in range(2, n + 1):
    if IsPrime[i]:
        for j in range(i * i, n + 1, i):
            IsPrime[j] = False

maxp = -1
for j in range(n, -1, -1):
    if IsPrime[j]:
        maxp = j
        break

ans = 1
for i in range(2, n + 1):
    if i == maxp:
        continue
    if IsPrime[i]:
        j = i
        while j * i <= n:
            j *= i
        ans *= j
        ans %= mod
print(ans)