mod = 998244353
N = 2*10**5 + 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())
for k in range(1, n+1):
	print(pow(n - k + 1, 2, mod) * (n + 1) % mod * k % mod * cmb(n, k-1) * fact[k-1] * fact[n-k] * pow(k+1, mod-2, mod) % mod)