def seachPrimeNum(N):
    max = int(N ** 0.5)
    seachList = [i for i in range(2, N + 1)]
    primeNum = []
    while seachList[0] <= max:
        primeNum.append(seachList[0])
        tmp = seachList[0]
        seachList = [i for i in seachList if i % tmp != 0]
    primeNum.extend(seachList)
    return primeNum

def adic(dic, x):
    if x in dic:
        dic[x] += 1
    else:
        dic[x] = 1
    return

def factorization(x):
    dic = {}
    i = 0
    p = PL[i]
    while p * p <= x:
        if x % p == 0:
            adic(dic, p)
            x //= p
        else:
            i += 1
            if i < len(PL):
                p = PL[i]
    if x != 1:
        adic(dic, x)
    return dic

MOD = 998244353
from collections import defaultdict
dic = defaultdict(int)
N = int(input())
PL = seachPrimeNum(int(N ** 0.5) + 1000)
for i in range(1, N//2+1):
    X = factorization(i * (N - i))
    for k, v in X.items():
        if dic[k] < v:
            dic[k] = v
ans = 1
for k, v in dic.items():
    ans *= pow(k, v, MOD)
    ans %= MOD

print(ans)