mod = 998244353
N = 10**7 + 5
fact = [1]*(N+1)
factinv = [1]*(N+1)

for i in range(2, N+1):
	fact[i] = fact[i-1] * i % mod

factinv[-1] = pow(fact[-1], mod-2, mod)
for i in range(N-1, 1, -1):
	factinv[i] = factinv[i+1] * (i+1) % mod

def cmb(a, b):
	if (a < b) or (b < 0):
		return 0
	return fact[a] * factinv[b] % mod * factinv[a-b] % mod

n = int(input())

h20, h21 = 0, 2
h30, h31, h32 = 0, 0, 6

# h30^3 + 3h20^2 + h10 の累積和
ans = 0

for i in range(1, n+1):
	ans += (h30 + 3 * h20 + fact[i-1]) % mod * factinv[i] % mod
	ans %= mod
	h20, h21 = h21, (h21 * (2*i+1) % mod - h20 * i % mod * i) % mod
	h30, h31, h32 = h31, h32, (h32 * (3+3*i) % mod - h31 * (3*i*i%mod+3*i+1) % mod + h30 * i % mod * i % mod * i % mod) % mod

print(ans * fact[n] % mod)