MOD = 998244353

N = int(input())

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

fact_inv = [1] * (max_k + 1)
fact_inv[max_k] = pow(fact[max_k], MOD-2, MOD)
for i in range(max_k - 1, -1, -1):
    fact_inv[i] = fact_inv[i+1] * (i+1) % MOD

for i in range(N + 1):
    if i == 0:
        print(0)
    else:
        k = N - i
        if k % 2 == 0:
            sign = 1
        else:
            sign = MOD - 1
        res = sign * fact_inv[k] % MOD
        print(res)