import math
import collections
#素因数分解
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

N=int(input())
L = []
L.append([])
for i in range(1,N):
    L.append(prime_factorize(i))

d = collections.defaultdict(int)

for i in range(1,N//2+1):
    TEMP = L[i]+L[N-i]
    dd = collections.defaultdict(int)
    for temp in TEMP:
        dd[temp]+=1
    for k,v in dd.items():
        d[k]=max(d[k],v)

ans = 1
for k,v in d.items():
    ans = ans*k**v%998244353
print(ans)