N = int(input())
mod = 998244353
mfact = [1]
res = 1
for i in range(1, N+100):
    res *= i
    res %= mod
    mfact.append(res)


MAX = 2 * 10**5 + 10


fact = [1] * MAX
inv = [1] * MAX
fact_inv = [1] * MAX

for i in range(2, MAX):
    fact[i] = fact[i - 1] * i % mod
    inv[i] = mod - inv[mod % i] * (mod // i) % mod
    fact_inv[i] = fact_inv[i - 1] * inv[i] % mod


def comb(n, r):
    if r < 0 or r > n:
        return 0
    return fact[n] * fact_inv[r] % mod * fact_inv[n - r] % mod

ans = 0
for k in range(1, N+10):
    if N-2*k+1 >= 0 and N-2*k+1 <= k+1:
        ans += comb(k+1, N-2*k+1)*mfact[k]*mfact[N-k]
        ans %= mod

print(ans%mod)