from collections import *

class Fast_factorize:
    def __init__(self, n):
        self.p = [-1]*(n+1)
        
        for i in range(2, n+1):
            if self.p[i]==-1:
                for j in range(i, n+1, i):
                    if self.p[j]==-1:
                        self.p[j] = i
    
    def factorize(self, n):
        res = []
        
        while n>1:
            res.append(self.p[n])
            n //= self.p[n]
        
        return res

N = int(input())
ff = Fast_factorize(N)
cnt = defaultdict(int)

for i in range(1, N):
    cnt1 = Counter(ff.factorize(i))
    cnt2 = Counter(ff.factorize(N-i))
    ks = set(list(cnt1.keys())+list(cnt2.keys()))
    
    for k in ks:
        cnt[k] = max(cnt[k], cnt1[k]+cnt2[k])

ans = 1
MOD = 998244353

for k, v in cnt.items():
    ans *= pow(k, v, MOD)
    ans %= MOD

print(ans)