from collections import Counter


# 素因数分解（Counter）
def prime_factorize(n):
    a = Counter()
    while n % 2 == 0:
        a[2] += 1
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a[f] += 1
            n //= f
        else:
            f += 2
    if n != 1:
        a[n] += 1
    return a


n = int(input())

MOD = 998244353

# 始めに、1~nまでの素因数分解を前計算
ps = [0] * (n + 1)
for i in range(1, n + 1):
    ps[i] = prime_factorize(i)

l = Counter()
for i in range(1, n // 2 + 1):
    l |= (ps[i] + ps[n - i])

ans = 1
for k, v in l.items():
    ans *= pow(k, v, MOD)
    ans %= MOD

print(ans)