n = int(input())

import math

def sieve(n):
    ass = []
    is_prime = [True]*(n+1)
    is_prime[0] = False
    is_prime[1] = False

    for i in range(2, int(math.sqrt(n))+1):
        if not is_prime[i]:
            continue
        for j in range(i*2, n+1, i):
            is_prime[j] = False
    for i in range(n+1):
        if is_prime[i]:
            ass.append(i)
    return(ass)

mod = 998244353

P = sieve(n)
M = max(P)
l = 1
for p in P:
    if p == M:
        continue
    x = 1
    cnt = 0
    while True:
        if x*p <= n:
            cnt += 1
            x *= p
        else:
            break
    l *= pow(p, cnt, mod)
    l %= mod
print(l)