from collections import Counter, defaultdict
import math

def prime_numbers(x):
    if x < 2:
        return []
    prime_numbers = [i for i in range(x)]
    prime_numbers[1] = 0
    for prime_number in prime_numbers:
        if prime_number > math.sqrt(x):
            break
        if prime_number == 0:
            continue
        for composite_number in range(2 * prime_number, x, prime_number):
            prime_numbers[composite_number] = 0
    return [prime_number for prime_number in prime_numbers if prime_number != 0]
primes = prime_numbers(10 ** 6 + 1)
def soinnsuu(x):
    s = []
    for i in primes:
        if i > int(math.sqrt(x)):
            break
        elif x % i == 0:
            while x % i == 0:
                x //= i
                s.append(i)
    if not x == 1:
        s.append(x)
    return Counter(s)
n = int(input())
Cs = []
for i in range(1, n):
    Cs.append(soinnsuu(i))
d = defaultdict(int)
for i in range(1, n):
    p1, p2 = Cs[i - 1], Cs[-i]
    for j in primes:
        d[j] = max(d[j], p1[j] + p2[j])
ans = 1
mod = 998244353
for k, v in d.items():
    ans *= pow(k, v, mod)
    ans %= mod
print(ans)