MOD = 998244353

n = int(input())

if n == 0:
    print(0)
    exit()

# Precompute factorial modulo MOD
fact = [1] * (n + 1)
for i in range(1, n + 1):
    fact[i] = fact[i-1] * i % MOD

# Precompute inverses of 1..n modulo MOD
inv = [0] * (n + 1)
for i in range(1, n + 1):
    inv[i] = pow(i, MOD-2, MOD)

e0 = 1
e1 = 0
e2 = 0
e3 = 0

for i in range(1, n + 1):
    inv_i = inv[i]
    # Update e3
    e3 = (e3 + e2 * inv_i) % MOD
    # Update e2
    e2 = (e2 + e1 * inv_i) % MOD
    # Update e1
    e1 = (e1 + e0 * inv_i) % MOD

# Compute the sum with the correct coefficients
sum_val = (e1 + 6 * e2 + 6 * e3) % MOD
# Multiply by factorial[n] mod MOD
ans = sum_val * fact[n] % MOD

print(ans)