MOD = 998244353

N = int(input())

max_fact = N
fact = [1] * (max_fact)
for i in range(1, max_fact):
    fact[i] = fact[i-1] * i % MOD

inv_fact = [1] * (max_fact)
if max_fact > 0:
    inv_fact[max_fact-1] = pow(fact[max_fact-1], MOD-2, MOD)
    for i in range(max_fact-2, -1, -1):
        inv_fact[i] = inv_fact[i+1] * (i+1) % MOD

ans = [0] * (N + 1)

for i in range(1, N + 1):
    k = N - i
    sign = pow(-1, k, MOD)
    term = sign * fact[N-1] % MOD
    inv_part = inv_fact[i-1] * pow(inv_fact[N - i], 2, MOD) % MOD
    ans[i] = term * inv_part % MOD

for a in ans:
    print(a)