n = int(input())
mod = 998244353
prime = [0]*(n+1)
p = []
for i in range(2,n+1):
    if prime[i]:
        continue
    p.append(i)
    for j in range(i,n+1,i):
        prime[j] = 1

count = {}
for i in range(1,n//2+1):
    dic = {}
    now = i
    for j in p:
        if j > now:
            break
        if now%j:
            continue
        c = 0
        while now%j == 0:
            now //= j
            c += 1
        dic[j] = dic.get(j,0)+c
    now = n-i
    for j in p:
        if j > now:
            break
        if now%j:
            continue
        c = 0
        while now%j == 0:
            now //= j
            c += 1
        dic[j] = dic.get(j,0)+c
    for k,v in dic.items():
        count[k] = max(count.get(k,0),v)
ans = 1
for k,v in count.items():
    ans *= pow(k,v,mod)
    ans %= mod
print(ans)