MOD = 998244353

N = int(input())

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

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

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 term = S1^3 + 3*S1^2 + S1 - 3*S2*(1 + S1) + 2*S3 mod MOD
term = pow(S1, 3, MOD)
term = (term + 3 * pow(S1, 2, MOD)) % MOD
term = (term + S1) % MOD

temp = (3 * S2) % MOD
temp = (temp * (1 + S1)) % MOD
term = (term - temp) % MOD  # Ensure non-negative
term = (term + 2 * S3) % MOD

# Compute factorial mod MOD
fact = 1
for i in range(1, N + 1):
    fact = (fact * i) % MOD

ans = (fact * term) % MOD

print(ans)