from collections import defaultdict
mod = 998244353
n = int(input())
P = [0]*(n+1)
P[0] = P[1] = 1
for i in range(2, n+1):
    if P[i]:
        continue
    for j in range(i, n+1, i):
        P[j] = i
C = [0]*(n+1)
for i in range(1, n//2+1):
    j = n-i
    D = defaultdict(int)
    while i > 1:
        d = 0
        p = P[i]
        while i%p == 0:
            i //= p
            d += 1
        D[p] += d
    while j > 1:
        d = 0
        p = P[j]
        while j%p == 0:
            j //= p
            d += 1
        D[p] += d
    for k, v in D.items():
        C[k] = max(C[k], v)
ans = 1
for i in range(1, n+1):
    ans *= pow(i, C[i], mod)
    ans %= mod
print(ans)