mod = 998244353
n = int(input())

erathosthenes = [1] * (n + 1)

for i in range(2, len(erathosthenes)):
    if erathosthenes[i] == 1:
        for j in range(i, len(erathosthenes), i):
            if erathosthenes[j] == 1:
                erathosthenes[j] = i

for i in reversed(range(1, len(erathosthenes))):
    if erathosthenes[i] == i:
        max_prime = i
        break

factors = {}

for i in range(1, len(erathosthenes)):
    if i != max_prime:
        current = i
        primes = {}
        while erathosthenes[current] > 1:
            p = erathosthenes[current]
            count = primes.get(p, 0)
            primes[p] = count + 1
            current //= p

        for p, count in primes.items():
            c = factors.get(p, 0)
            factors[p] = max(c, count)

result = 1

for p, count in factors.items():
    for _ in range(count):
        result *= p
        result %= mod
        
print(result)