N=int(input())

from math import gcd
from collections import Counter

mod=998244353

X=[i for i in range(10**6+1)]
FACT=[Counter() for i in range(10**6+1)]

for i in range(2,10**6+1):
    if X[i]!=1:
        k=X[i]
        for j in range(i,10**6+1,i):
            X[j]//=k
            FACT[j][k]+=1

LCM=Counter()

for j in range(1,N):
    D1=FACT[j]
    D2=FACT[N-j]

    for s in set(D1.keys())|set(D2.keys()):
        LCM[s]=max(LCM[s],D1[s]+D2[s])

#print(LCM)

ANS=1
for s in LCM:
    ANS=ANS*pow(s,LCM[s],mod)%mod

print(ANS)