MOD = 998244353

N = int(input())

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

# Precompute inverses
inv = [0] * (N + 1)
inv[1] = 1
for i in range(2, N + 1):
    inv[i] = MOD - MOD // i * inv[MOD % i] % MOD

# Precompute factorials
fact = [1] * (N + 1)
for i in range(2, N + 1):
    fact[i] = fact[i-1] * i % MOD

# Compute S1, S2, S3
s1 = 0
s2 = 0
s3 = 0
for i in range(1, N + 1):
    s1 = (s1 + inv[i]) % MOD
    inv_i_sq = inv[i] * inv[i] % MOD
    s2 = (s2 + inv_i_sq) % MOD
    inv_i_cu = inv_i_sq * inv[i] % MOD
    s3 = (s3 + inv_i_cu) % MOD

# Compute the term
term = (pow(s1, 3, MOD) + 3 * pow(s1, 2, MOD) + s1) % MOD
term = (term - 3 * s2) % MOD
term = (term - 3 * s1 * s2 % MOD) % MOD
term = (term + 2 * s3) % MOD

# Multiply by fact[N] and ensure non-negative
ans = (term * fact[N] + MOD) % MOD

print(ans)