MOD = 998244353
N = 1000100
isprime = [True] * N
isprime[0] = isprime[1] = False
for i in range(2, int(N ** 0.5 + 1)):
    if not isprime[i]:
        continue
    for j in range(i * i, N, i):
        isprime[j] = False
       
n = int(input())
flg = True
ans = 1
for i in range(n, 0, -1):
    if not isprime[i]:
        continue
    if flg:
        flg = False
        continue
    j = i
    while j * i <= n:
        j *= i
    ans *= j
    ans %= MOD
print(ans)