from collections import defaultdict, Counter
from itertools import chain


def prime_set(N):
    """
    Nまでの素数のsetを返す
    """
    if N < 4:
        return ({}, {}, {2}, {2, 3})[N]
    Nsq = int(N ** 0.5 + 0.5) + 1
    primes = {2, 3} | set(chain(range(5, N + 1, 6), range(7, N + 1, 6)))
    for i in range(5, Nsq, 2):
        if i in primes:
            primes -= set(range(i * i, N + 1, i * 2))
    return primes


def prime_sieve(N):
    #sieve[i] : iの最小の素因数
    sieve = [0] * (N + 1)
    prime = []
    for i in range(2, N + 1):
        if sieve[i] == 0:
            sieve[i] = i
            prime.append(i)
        for p in prime:
            if p > sieve[i] or i * p > N:
                break
            sieve[i * p] = p
    return sieve


N = int(input())
mod = 998244353
sieve = prime_sieve(N)
cnt = defaultdict(int)

for x in range(1, N):
    y = N - x
    if x > y:
        break

    P = []
    while sieve[x] != 0:
        s = sieve[x]
        P.append(s)
        x //= s
    while sieve[y] != 0:
        s = sieve[y]
        P.append(s)
        y //= s

    for k, v in Counter(P).items():
        cnt[k] = max(cnt[k], v)

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