mod = 998244353

N = int(input())
N1 = max(N + 1, 4)
inv = [1] * N1
for i in range(2, N1):
    inv[i] = mod - mod // i * inv[mod % i] % mod
invpow = [1] * (N + 1)
invpow[0] = 0

# Newton's Identities
p = [0] * 4
p[0] = N
for k in range(1, 4):
    for i in range(2, N + 1):
        invpow[i] = invpow[i] * inv[i] % mod
    p[k] = sum(invpow) % mod

e = [1] * 4
for k in range(1, 4):
    tmp = 0
    flag = -1
    for i in range(1, k + 1):
        flag = -flag
        tmp = (tmp + flag * e[k - i] * p[i]) % mod
    e[k] = tmp * inv[k] % mod

ans = (e[1] + 3 * 2 * e[2] + 6 * e[3]) % mod
for k in range(1, N + 1):
    ans = ans * k % mod
print(ans)