N, MOD = int(input()), 998244353

is_prime = [False] * 2 + [True] * (N - 1)
primes = []
for i in range(2, N + 1):
    if is_prime[i]:
        primes.append(i)
        for j in range(2 * i, N + 1, i):
            is_prime[j] = False

ans = 1
for p in primes[:-1]:
    q = p
    while q * p <= N:
        q *= p
    ans = ans * q % MOD
print(ans)