import math

def main():

    N = 10**6+1
    spf = [-1]*(N+1)
    for i in range(N+1):
        spf[i] = i
    for i in range(2, int(math.sqrt(N))+1):
        if spf[i] == i:
            for j in range(i*2, N+1, i):
                if spf[j] == j:
                    spf[j] = i

    def factorize(n):
        d = {}
        while n != 1:
            p = spf[n]
            if p in d:
                d[p] += 1
            else:
                d[p] = 1
            n //= p
        return d

    n = int(input())

    mod = 998244353
    from collections import defaultdict
    D = [defaultdict(lambda: 0) for i in range(n)]
    for i in range(1, n):
        if i == 1:
            continue
        d = factorize(i)
        for k, v in d.items():
            D[i][k] += v
            D[n-i][k] += v
    P = defaultdict(lambda: 0)
    for i in range(1, n):
        d = D[i]
        for k, v in d.items():
            P[k] = max(P[k], v)
    ans = 1
    for k, v in P.items():
        ans *= pow(k, v, mod)
        ans %= mod
    print(ans)

if __name__ == '__main__':
    main()