from collections import Counter
N = int(input())
MOD = 998244353
spf = [1]*(N+1)
for i in range(2, N+1):
    for j in range(i, N+1, i):
        if spf[j] == 1:
            spf[j] = i


def factorization(n):
    x = []
    while n > 1:
        x.append(spf[n])
        n //= spf[n]
    return x


A = [0]*(N+1)
ans = 1
for i in range(1, N//2+1):
    a = i
    b = N-i
    x = Counter(factorization(a)+factorization(b)).most_common()
    for n, c in x:
        A[n] = max(A[n], c)

for i in range(N+1):
    ans = ans*pow(i, A[i], MOD) % MOD
print(ans)